- 博客(9)
- 收藏
- 关注
原创 [leetcode] 473. Matchsticks to Square
Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchsticks. You shoul
2016-12-29 18:10:13 1257
原创 [leetcode] 451. Sort Characters By Frequency
Given a string, sort it in decreasing order based on the frequency of characters.Example 1:Input:"tree"Output:"eert"Explanation:'e' appears twice while 'r' and 't' both appear once.So 'e
2016-12-26 18:27:47 337
原创 [leetcode] 477. Total Hamming Distance
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Now your job is to find the total Hamming distance between all pairs of the giv
2016-12-20 17:43:58 342
原创 [leetcode] 455. Assign Cookies
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 greed factor gi, which is the minimum size of a c
2016-12-16 17:58:16 337
原创 [leetcode] 474. Ones and Zeroes
In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.For now, suppose you are a dominator of m 0s and n 1s respectively. On the ot
2016-12-13 17:48:58 3347 2
原创 [leetcode] 403. Frog Jump
A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.Given a list of
2016-12-08 17:48:53 471
原创 [leetcode] 423. Reconstruct Original Digits from English
Given a non-empty string containing an out-of-order English representation of digits 0-9, output the digits in ascending order.Note:Input contains only lowercase English letters.Input is g
2016-12-06 18:10:27 424
原创 [leetcode] 394. Decode String
Given an encoded string, return it's decoded string.The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note thatk is
2016-12-02 19:34:46 257
原创 [leetcode] 393. UTF-8 Validation
A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:For 1-byte character, the first bit is a 0, followed by its unicode code.For n-bytes character, the first n-bits
2016-12-01 17:25:50 731
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人