leetcode
文章平均质量分 67
isunn
这个作者很懒,什么都没留下…
展开
-
leetcode -- Combination Sum
leetcode -- Combination Sum原创 2015-03-06 20:57:50 · 596 阅读 · 0 评论 -
leetcode -- Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subarray [4,−1,2,1]原创 2015-03-14 10:42:11 · 785 阅读 · 0 评论 -
leetcode -- Count and Say
The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, ... 1 is read off as "one 1" or 11. 11 is read off as "two 1s" or 21. 21 is read off as原创 2015-03-05 22:14:45 · 381 阅读 · 0 评论 -
leetcode -- Maximum Gap
Given an unsorted array, find the maximum difference between the successive elements in its sorted form. Try to solve it in linear time/space. Return 0 if the array contains less than 2 elements原创 2016-01-04 11:01:08 · 351 阅读 · 0 评论 -
leetcode -- Compare Version Numbers
Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0. You may assume that the version strings are non-empty and co原创 2016-01-04 13:55:05 · 440 阅读 · 0 评论 -
leetcode -- Fraction to Recurring Decimal
Given two integers representing the numerator and denominator of a fraction, return the fraction in string format. If the fractional part is repeating, enclose the repeating part in parentheses.原创 2016-01-05 11:15:22 · 589 阅读 · 0 评论