你的朋友不及格,你很难过;你的朋友考了第一,你更难过。

我问佛∶世间为何有那麽多遗憾? 佛曰∶这是一个婆娑世界,婆娑既遗憾, 没有遗憾,给你再多幸福也不会体会快乐。...

[leetcode] 97. Interleaving String

Description Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Example 1: Input: s1 = "aabcc", s2 = &...

2019-02-17 22:09:39

阅读数 4

评论数 0

[leetcod] 12. Integer to Roman

Description Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X ...

2019-02-17 22:00:31

阅读数 5

评论数 0

[leetcode] 273. Integer to English Words

Description Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1. Example 1: Input: ...

2019-02-17 21:53:40

阅读数 20

评论数 0

[leetcode] 343. Integer Break

Description Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return th...

2019-02-17 21:46:19

阅读数 7

评论数 0

[leetcode] 147. Insertion Sort List

Description Sort a linked list using insertion sort. A graphical example of insertion sort. The partial sorted list (black) initially contains only ...

2019-02-17 21:12:07

阅读数 3

评论数 0

[leetcode] 57. Insert Interval

Description Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the interval...

2019-02-17 21:07:00

阅读数 4

评论数 0

[leetcode] 380. Insert Delete GetRandom O(1)

Description Design a data structure that supports all following operations in average O(1) time. insert(val): Inserts an item val to the set if not ...

2019-02-17 20:48:55

阅读数 3

评论数 0

[leetcode] 381. Insert Delete GetRandom O(1) - Duplicates allowed

Description Design a data structure that supports all following operations in average O(1) time. Note: Duplicate elements are allowed. insert(val): ...

2019-02-17 20:41:29

阅读数 9

评论数 0

[leetcode] 334. Increasing Triplet Subsequence

Description Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: R...

2019-02-17 20:23:54

阅读数 3

评论数 0

[leetcode] 208. Implement Trie (Prefix Tree)

Description Implement a trie with insert, search, and startsWith methods. Example: Trie trie = new Trie(); trie.insert("apple"); t...

2019-02-17 16:53:11

阅读数 5

评论数 0

[leetcode] 28. Implement strStr()

Description Implement strStr(). Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Example 1: I...

2019-02-17 14:25:00

阅读数 5

评论数 0

[leetcode] 225. Implement Stack using Queues

Description Implement the following operations of a stack using queues. push(x) – Push element x onto stack. pop() – Removes the element on top of th...

2019-02-17 14:18:26

阅读数 8

评论数 0

[leetcode] 676. Implement Magic Dictionary

Description Implement a magic dictionary with buildDict, and search methods. For the method buildDict, you’ll be given a list of non-repetitive words...

2019-02-17 14:07:33

阅读数 11

评论数 0

[leetcode] 835. Image Overlap

Description Two images A and B are given, represented as binary, square matrices of the same size. (A binary matrix has only 0s and 1s as values.) W...

2019-02-17 13:51:52

阅读数 11

评论数 0

[leetcode] 198. House Robber

Description You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constrain...

2019-02-17 13:30:54

阅读数 4

评论数 0

[leetcode] 337. House Robber III

Description The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the r...

2019-02-17 13:23:43

阅读数 2

评论数 0

[leetcode] 213. House Robber II

Description You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this...

2019-02-17 13:15:23

阅读数 4

评论数 0

[leetcode] 475. Heaters

Description Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses. Now, yo...

2019-02-17 11:52:51

阅读数 11

评论数 0

[leetcode] 202. Happy Number

Description Write an algorithm to determine if a number is “happy”. A happy number is a number defined by the following process: Starting with any po...

2019-02-17 11:43:10

阅读数 9

评论数 0

[leetcode] 846. Hand of Straights

Description Alice has a hand of cards, given as an array of integers. Now she wants to rearrange the cards into groups so that each group is size W, ...

2019-02-17 11:36:19

阅读数 22

评论数 0

提示
确定要删除当前文章?
取消 删除
关闭
关闭