LeetCode其他
文章平均质量分 87
ForABiggerWorld
这个作者很懒,什么都没留下…
展开
-
738. Monotone Increasing Digits
Given 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 pai...原创 2017-12-03 13:12:14 · 279 阅读 · 0 评论 -
306. Additive Number
Additive number is a string whose digits can form additive sequence.A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the原创 2017-12-29 18:52:59 · 224 阅读 · 0 评论 -
679. 24 Game
You have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through *, /, +, -, (, )to get the value of 24.Example 1:Input: [4, 1, 8, 7]Output: TrueExplanati...原创 2017-09-18 19:44:07 · 854 阅读 · 0 评论 -
683. K Empty Slots
There is a garden with N slots. In each slot, there is a flower. The N flowers will bloom one by one in N days. In each day, there will be exactly one flower blooming and it will be in the status原创 2017-09-24 10:54:48 · 820 阅读 · 0 评论 -
681. Next Closest Time
Given a time represented in the format "HH:MM", form the next closest time by reusing the current digits. There is no limit on how many times a digit can be reused.You may assume the given input s原创 2017-09-24 11:01:37 · 1113 阅读 · 0 评论 -
458. Poor Pigs
There are 1000 buckets, one and only one of them contains poison, the rest are filled with water. They all look the same. If a pig drinks that poison it will die within 15 minutes. What is the minimum原创 2017-09-26 12:41:10 · 243 阅读 · 0 评论 -
750. Number Of Corner Rectangles
Given a grid where each entry is only 0 or 1, find the number of corner rectangles.A corner rectangle is 4 distinct 1s on the grid that form an axis-aligned rectangle. Note that only the corners n原创 2017-12-17 13:01:27 · 1226 阅读 · 0 评论 -
755. Reach a Number
You are standing at position 0 on an infinite number line. There is a goal at position target.On each move, you can either go left or right. During the n-th move (starting from 1), you take n step原创 2018-01-01 14:25:39 · 383 阅读 · 0 评论 -
694. Number of Distinct Islands
Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are su原创 2017-10-08 16:01:01 · 1827 阅读 · 0 评论 -
699. Falling Squares
On an infinite number line (x-axis), we drop given squares in the order they are given.The i-th square dropped (positions[i] = (left, side_length)) is a square with the left-most point being pos原创 2017-10-16 11:09:27 · 649 阅读 · 0 评论 -
382. Linked List Random Node
Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen.Follow up:What if the linked list is extremely large and i原创 2017-10-21 08:45:13 · 202 阅读 · 0 评论 -
729. My Calendar I && 731. My Calendar II && 732. My Calendar III
Implement a MyCalendar class to store your events. A new event can be added if adding the event will not cause a double booking.Your class will have the method, book(int start, int end). Formall原创 2017-11-26 12:08:51 · 1269 阅读 · 0 评论 -
722. Remove Comments
Given a C++ program, remove comments from it. The program source is an array where source[i] is the i-th line of the source code. This represents the result of splitting the original source code s原创 2017-11-30 20:27:26 · 355 阅读 · 0 评论 -
739. Daily Temperatures
Given a list of daily temperatures, produce a list that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which thi原创 2017-12-03 13:08:54 · 607 阅读 · 0 评论 -
146. LRU Cache
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of the key if th...原创 2016-12-04 19:39:51 · 292 阅读 · 0 评论