greedy
文章平均质量分 83
ForABiggerWorld
这个作者很懒,什么都没留下…
展开
-
1405. Longest Happy String
A string is calledhappyif it doesnot have any of the strings'aaa','bbb'or'ccc'as a substring.Given three integersa,bandc, returnanystrings,which satisfies following conditions:sis...原创 2020-04-07 21:59:29 · 268 阅读 · 0 评论 -
1383. Maximum Performance of a Team
There arenengineers numbered from 1 tonandtwo arrays:speedandefficiency, wherespeed[i]andefficiency[i]represent the speed and efficiency for the i-th engineer respectively.Return the maxim...原创 2020-03-24 21:12:16 · 294 阅读 · 0 评论 -
1326. Minimum Number of Taps to Open to Water a Garden
There is a one-dimensional garden on the x-axis. The garden starts at the point0and ends at the pointn. (i.e The length of the garden isn).There aren + 1taps locatedat points[0, 1, ..., n]i...原创 2020-01-25 21:18:01 · 422 阅读 · 0 评论 -
1024. Video Stitching
You are given a series of video clips from a sporting event that lastedTseconds.These video clips can be overlapping with each other and have varied lengths.Each video clipclips[i]is an interv...原创 2019-04-09 18:15:15 · 1351 阅读 · 0 评论 -
1233. Remove Sub-Folders from the Filesystem
Given a list of folders, remove all sub-folders in those folders and return inany orderthe folders after removing.If afolder[i]is located withinanotherfolder[j], it is called asub-folderof i...原创 2019-10-20 14:27:10 · 463 阅读 · 0 评论 -
1090. Largest Values From Labels
We have a set of items: thei-th item has valuevalues[i]and labellabels[i].Then, we choosea subsetSof these items, such that:|S| <= num_wanted For every labelL, the number of items inS...原创 2019-06-16 13:24:32 · 373 阅读 · 0 评论 -
1054. Distant Barcodes
In a warehouse, there is a row of barcodes, where thei-th barcode isbarcodes[i].Rearrange the barcodes so that no two adjacent barcodes are equal. You may return any answer, and it is guaranteed ...原创 2019-05-26 12:00:09 · 380 阅读 · 0 评论 -
1004. Max Consecutive Ones III
Given an arrayAof 0s and 1s, we may change up toKvalues from 0 to 1.Return the length of the longest (contiguous) subarray that contains only 1s.Example 1:Input: A = [1,1,1,0,0,0,1,1,1,...原创 2019-03-03 12:39:51 · 140 阅读 · 0 评论 -
995. Minimum Number of K Consecutive Bit Flips
In an array A containing only 0s and 1s, a K-bit flip consists of choosing a (contiguous) subarray of length K and simultaneously changing every 0 in the subarray to 1, and every 1 in the subarray to ...原创 2019-02-17 20:59:43 · 289 阅读 · 0 评论 -
955. Delete Columns to Make Sorted II
We are given an array A of N lowercase letter strings, all of the same length.Now, we may choose any set of deletion indices, and for each string, we delete all the characters in those indices.For...原创 2018-12-09 14:01:38 · 435 阅读 · 0 评论 -
435. Non-overlapping Intervals && 436. Find Right Interval && 452. Minimum Number of Arrows to Burst
Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.Note:You may assume the interval's end point is always...原创 2017-04-02 11:04:49 · 572 阅读 · 0 评论 -
625. Minimum Factorization & 621. Task Scheduler
思路:子所以把这两个题放在一起,感觉都要贪心的一个概念Given a positive integer a, find the smallest positive integer b whose multiplication of each digit equals to a.If there is no answer or the answer is not fit原创 2017-06-18 14:05:15 · 733 阅读 · 0 评论 -
630. Course Schedule III
There are n different online courses numbered from 1 to n. Each course has some duration(course length) t and closed on dthday. A course should be taken continuously for t days and must be finished be...原创 2017-06-25 17:38:46 · 1144 阅读 · 0 评论 -
659. Split Array into Consecutive Subsequences
You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subsequences consist of at least 3 consecutive integers....原创 2017-08-14 09:00:54 · 2100 阅读 · 0 评论 -
759. Employee Free Time
We are given a list schedule of employees, which represents the working time for each employee.Each employee has a list of non-overlapping Intervals, and these intervals are in sorted order.Re原创 2018-01-08 21:30:45 · 577 阅读 · 0 评论 -
376. Wiggle Subsequence
A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either pos...原创 2018-01-23 09:24:39 · 362 阅读 · 0 评论 -
765. Couples Holding Hands
N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side by side. A swap consists of choosing any two people原创 2018-01-14 16:12:05 · 1155 阅读 · 0 评论 -
757. Set Intersection Size At Least Two
An integer interval [a, b] (for integers a < b) is a set of all consecutive integers from a to b, including a and b.Find the minimum size of a set S such that for every integer interval A in i...原创 2018-01-01 15:09:49 · 668 阅读 · 0 评论