米开朗菠萝

2020年3月29日

摘要： Assume 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 g 阅读全文

posted @ 2020-03-29 13:50 米开朗菠萝阅读(136) 评论(0) 推荐(0)

452. Minimum Number of Arrows to Burst Balloons

摘要： There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the hor 阅读全文

posted @ 2020-03-29 11:34 米开朗菠萝阅读(99) 评论(0) 推荐(0)

402. Remove K Digits

摘要： Given 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 l 阅读全文

posted @ 2020-03-29 10:09 米开朗菠萝阅读(130) 评论(0) 推荐(0)

2020年3月25日

122. Best Time to Buy and Sell Stock II

摘要： Say you have an array 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 comple 阅读全文

posted @ 2020-03-25 19:59 米开朗菠萝阅读(132) 评论(0) 推荐(0)

55. Jump Game

摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文

posted @ 2020-03-25 19:39 米开朗菠萝阅读(125) 评论(0) 推荐(0)

2020年3月22日

377. Combination Sum IV

摘要： Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target. 阅读全文

posted @ 2020-03-22 18:44 米开朗菠萝阅读(120) 评论(0) 推荐(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 阅读全文

posted @ 2020-03-22 17:53 米开朗菠萝阅读(154) 评论(0) 推荐(0)

357. Count Numbers with Unique Digits

摘要： Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n. Example: Input: 2 Output: 91 Explanation: The answer shoul 阅读全文

posted @ 2020-03-22 11:16 米开朗菠萝阅读(118) 评论(0) 推荐(0)

2020年3月21日

304. Range Sum Query 2D - Immutable

摘要： Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2 阅读全文

posted @ 2020-03-21 22:19 米开朗菠萝阅读(148) 评论(0) 推荐(0)

279. Perfect Squares

摘要： Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. Example 1: Input: n = 12 O 阅读全文

posted @ 2020-03-21 21:34 米开朗菠萝阅读(112) 评论(0) 推荐(0)

星星的孩子

公告