07 2020 档案

Leetcode: 220. Contains Duplicate III
摘要：Description Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between 阅读全文
posted @ 2020-07-26 16:10 tmortred 阅读(156) 评论(0) 推荐(0)
Leetcode: 327. Count of Range Sum
摘要：Descrption Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive. Range sum S(i, j) is defined as the sum 阅读全文
posted @ 2020-07-22 19:56 tmortred 阅读(178) 评论(0) 推荐(0)
Leetcode: 493. Reverse Pairs
摘要：Description Given an array nums, we call (i, j) an important reverse pair if i < j and nums[i] > 2*nums[j]. You need to return the number of important 阅读全文
posted @ 2020-07-19 17:33 tmortred 阅读(115) 评论(0) 推荐(0)
Leetcode: 632. Smallest Range Covering Elements from K Lists
摘要：Description You have k lists of sorted integers in ascending order. Find the smallest range that includes at least one number from each of the k lists 阅读全文
posted @ 2020-07-19 12:56 tmortred 阅读(114) 评论(0) 推荐(0)
Leetcode: 30. Substring with Concatenation of All Words
摘要：Description You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s tha 阅读全文
posted @ 2020-07-18 15:27 tmortred 阅读(124) 评论(1) 推荐(0)
Leetcode: 982. Triples with Bitwise AND Equal To Zero
摘要：Description Given an array of integers A, find the number of triples of indices (i, j, k) such that: 0 <= i < A.length 0 <= j < A.length 0 <= k < A.le 阅读全文
posted @ 2020-07-09 18:55 tmortred 阅读(115) 评论(0) 推荐(0)
1335. Minimum Difficulty of a Job Schedule
摘要：Description You want to schedule a list of jobs in d days. Jobs are dependent (i.e To work on the i-th job, you have to finish all the jobs j where 0 阅读全文
posted @ 2020-07-08 19:41 tmortred 阅读(384) 评论(0) 推荐(0)
Leetcode: 1449. Form Largest Integer With Digits That Add up to Target
摘要：Description Given an array of integers cost and an integer target. Return the maximum integer you can paint under the following rules: The cost of pai 阅读全文
posted @ 2020-07-04 16:04 tmortred 阅读(232) 评论(0) 推荐(0)
Leetcode: 115. Distinct Subsequences
摘要：Description Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequence of a string is a new string 阅读全文
posted @ 2020-07-04 14:31 tmortred 阅读(103) 评论(0) 推荐(0)
Leetcode: 879. Profitable Schemes
摘要：Description There are G people in a gang, and a list of various crimes they could commit. The i-th crime generates a profit[i] and requires group[i] g 阅读全文
posted @ 2020-07-04 11:58 tmortred 阅读(123) 评论(0) 推荐(0)
Leetcode: 689. Maximum Sum of 3 Non-Overlapping Subarrays
摘要：Description In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum. Each subarray will be of size k, and we 阅读全文
posted @ 2020-07-04 10:55 tmortred 阅读(123) 评论(0) 推荐(0)
Leetcode: 818 race car
摘要：Description Your car starts at position 0 and speed +1 on an infinite number line. (Your car can go into negative positions.) Your car drives automati 阅读全文
posted @ 2020-07-04 10:50 tmortred 阅读(126) 评论(0) 推荐(0)