leetcode贪心
文章平均质量分 50
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
881. Boats to Save People[Medium](Leetcode每日一题-2021.08.26)
Problem原创 2021-09-01 20:23:47 · 271 阅读 · 0 评论 -
581. Shortest Unsorted Continuous Subarray[Medium](Leetcode每日一题-2021.08.03)
ProblemGiven an integer array nums, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order.Return the shortest such subarray and output its length.Constrain原创 2021-08-03 19:08:19 · 219 阅读 · 0 评论 -
1877. Minimize Maximum Pair Sum in Array[Medium](Leetcode每日一题-2021.07.20)--抄答案
Problem原创 2021-07-26 19:38:38 · 234 阅读 · 0 评论 -
1846. Maximum Element After Decreasing and Rearranging[Medium](Leetcode每日一题-2021.07.15)--抄答案
ProblemYou are given an array of positive integers arr. Perform some operations (possibly none) on arr so that it satisfies these conditions:The value of the first element in arr must be 1.The absolute difference between any 2 adjacent elements must be原创 2021-07-16 22:09:29 · 534 阅读 · 0 评论 -
1833. Maximum Ice Cream Bars[Medium](Leetcode每日一题-2021.07.02)
ProblemIt is a sweltering summer day, and a boy wants to buy some ice cream bars.At the store, there are n ice cream bars. You are given an array costs of length n, where costs[i] is the price of the ith ice cream bar in coins. The boy initially has coin原创 2021-07-03 21:07:57 · 342 阅读 · 0 评论 -
995. Minimum Number of K Consecutive Bit Flips(Leetcode每日一题-2021.02.18)--抄答案
ProblemIn 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 0.Return the minimum number of K-bit flips requ原创 2021-02-18 18:55:09 · 147 阅读 · 0 评论 -
561. Array Partition I(Leetcode每日一题-2021.02.16)
ProblemGiven an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), …, (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum.Constraints:1 <= n <= 10^4nums.length == 2 * n原创 2021-02-16 09:17:17 · 160 阅读 · 0 评论 -
605. Can Place Flowers(Leetcode每日一题-2021.01.01)--抄答案
ProblemYou have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.Given an integer array flowerbed containing 0’s and 1’s, where 0 means empty and 1 means not empty, and an int原创 2021-01-01 09:17:56 · 175 阅读 · 0 评论 -
435. Non-overlapping Intervals(Leetcode每日一题-2020.12.31)--抄答案
ProblemGiven 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 bigger than its start point.Intervals like [1,2] a原创 2020-12-31 10:37:46 · 129 阅读 · 0 评论 -
1046. Last Stone Weight(Leetcode每日一题-2020.12.30)
ProblemWe have a collection of stones, each stone has a positive integer weight.Each turn, we choose the two heaviest stones and smash them together. Suppose the stones have weights x and y with x <= y. The result of this smash is:If x == y, both原创 2020-12-30 21:14:57 · 119 阅读 · 0 评论 -
330. Patching Array(Leetcode每日一题-2020.12.29)--抄答案
ProblemGiven a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be formed by the sum of some elements in the array. Return the minimum number of patches required.Examp原创 2020-12-29 21:26:01 · 136 阅读 · 0 评论 -
455. Assign Cookies(Leetcode每日一题-2020.12.25)--抄答案
ProblemAssume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie.Each child i has a greed factor g[i], which is the minimum size of a cookie that the child will be content with; and e原创 2020-12-26 21:39:54 · 156 阅读 · 0 评论 -
316. Remove Duplicate Letters(Leetcode每日一题-2020.12.20)--抄答案
ProblemGiven a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical order among all possible results.Constraints:1 <= s.length <= 104s consists of l原创 2020-12-20 21:18:39 · 239 阅读 · 0 评论 -
738. Monotone Increasing Digits(Leetcode每日一题-2020.12.15)--抄答案
ProblemGiven a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits.(Recall that an integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x <= y.E原创 2020-12-15 21:06:31 · 155 阅读 · 0 评论 -
376. Wiggle Subsequence(Leetcode每日一题-2020.12.12)
ProblemA 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 positive or negative. A sequence with fewer than tw原创 2020-12-12 19:12:43 · 196 阅读 · 0 评论 -
649. Dota2 Senate(Leetcode每日一题-2020.12.11)--抄答案
Solutionclass Solution {public: string predictPartyVictory(string senate) { int n = senate.size(); queue<int> radiant, dire; for (int i = 0; i < n; ++i) { if (senate[i] == 'R') { radiant.pu原创 2020-12-11 20:13:30 · 125 阅读 · 0 评论 -
860. Lemonade Change(Leetcode每日一题-2020.12.10)--抄答案
ProblemAt a lemonade stand, each lemonade costs $5.Customers are standing in a queue to buy from you, and order one at a time (in the order specified by bills).Each customer will only buy one lemonade and pay with either a $5, $10, or $20 bill. You mus原创 2020-12-10 19:56:39 · 147 阅读 · 0 评论 -
861. Score After Flipping Matrix(Leetcode每日一题-2020.12.07)
ProblemWe have a two dimensional matrix A where each value is 0 or 1.A move consists of choosing any row or column, and toggling each value in that row or column: changing all 0s to 1s, and all 1s to 0s.After making any number of moves, every row of thi原创 2020-12-07 20:59:40 · 164 阅读 · 0 评论 -
621. Task Scheduler(Leetcode每日一题-2020.12.05)--抄答案
ProblemGiven a characters array tasks, representing the tasks a CPU needs to do, where each letter represents a different task. Tasks could be done in any order. Each task is done in one unit of time. For each unit of time, the CPU could complete either o原创 2020-12-05 08:33:32 · 228 阅读 · 0 评论 -
659. Split Array into Consecutive Subsequences(Leetcode每日一题-2020.12.04)--抄答案
ProblemGiven an array nums sorted in ascending order, return true if and only if you can split it into 1 or more subsequences such that each subsequence consists of consecutive integers and has length at least 3.Constraints:1 <= nums.length <= 10原创 2020-12-05 08:30:21 · 157 阅读 · 0 评论 -
321. Create Maximum Number(Leetcode每日一题-2020.12.02)--抄答案
ProblemGiven two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k <= m + n from digits of the two. The relative order of the digits from the same array must be preserved. Return an array of the k原创 2020-12-03 20:52:46 · 173 阅读 · 0 评论 -
767. Reorganize String(Leetcode每日一题-2020.11.30)--抄答案
ProblemGiven a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same.If possible, output any possible result. If not possible, return the empty string.Note:S will consist of lowercase原创 2020-11-30 21:13:16 · 220 阅读 · 0 评论 -
976. Largest Perimeter Triangle(Leetcode每日一题-2020.11.29)
ProblemGiven an array A of positive lengths, return the largest perimeter of a triangle with non-zero area, formed from 3 of these lengths.If it is impossible to form any triangle of non-zero area, return 0.Note:3 <= A.length <= 100001 <= A[原创 2020-11-29 22:50:48 · 222 阅读 · 0 评论 -
452. Minimum Number of Arrows to Burst Balloons(Leetcode每日一题-2020.11.23)
ProblemThere are some spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it’s horizontal, y-coordinates don’t matter, and hence the x-coordinates of start原创 2020-11-23 19:42:43 · 162 阅读 · 0 评论 -
134. Gas Station(Leetcode每日一题-2020.11.18)
ProblemThere are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i+1). You begin the journey with an原创 2020-11-18 20:56:28 · 225 阅读 · 0 评论 -
406. Queue Reconstruction by Height(Leetcode每日一题-2020.11.16)
ProblemSuppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this person who have a height greater than or equal t原创 2020-11-16 20:46:27 · 142 阅读 · 0 评论 -
402. Remove K Digits(Leetcode每日一题-2020.11.15)
ProblemGiven a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.Note:The length of num is less than 10002 and will be ≥ k.The given num does not contain any leading zero.原创 2020-11-15 21:40:31 · 160 阅读 · 0 评论 -
122. Best Time to Buy and Sell Stock II(Leetcode每日一题-2020.11.08)
ProblemSay you have an array prices for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple原创 2020-11-08 21:24:04 · 139 阅读 · 0 评论 -
763. Partition Labels(Leetcode每日一题-2020.10.22)
ProblemA string S of lowercase English letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representing the size of these parts.Note:S will hav原创 2020-10-23 22:03:09 · 366 阅读 · 0 评论 -
45. Jump Game II(Leetcode每日一题-2020.05.04)
ProblemGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal...原创 2020-05-04 10:47:47 · 243 阅读 · 0 评论 -
55. Jump Game(Leetcode每日一题-2020.04.17)
占坑Refhttps://leetcode-cn.com/problems/jump-game/solution/55-by-ikaruga/原创 2020-04-17 17:06:12 · 1965 阅读 · 0 评论 -
1111. Maximum Nesting Depth of Two Valid Parentheses Strings(Leetcode每日一题-2020.04.01)
ProblemA string is a valid parentheses string (denoted VPS) if and only if it consists of “(” and “)” characters only, and:It is the empty string, orIt can be written as AB (A concatenated with B)...原创 2020-04-01 20:29:04 · 292 阅读 · 0 评论