https://leetcode.com/problems/largest-number/Given a list of non negative integers, arrange them such that they form the largest number.For example, g...
分类：
其他好文 时间：
2015-05-06 20:59:18
阅读次数：
117
此将主要将leetcode中sort专题的解答都放在这里，后续会慢慢加入
一：leetcode179 Largest Number
题目：
Given a list of non negative integers, arrange them such that they form the largest number.
For example, given [3, 30, 3...
分类：
其他好文 时间：
2015-05-06 19:46:06
阅读次数：
136
【题目】Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4]...
分类：
其他好文 时间：
2015-05-05 21:40:48
阅读次数：
137
Given a list of non negative integers, arrange them such that they form the largest number.For example, given[3, 30, 34, 5, 9], the largest formed num...
分类：
编程语言 时间：
2015-05-03 13:19:22
阅读次数：
181
69 down vote The largest port number is an unsigned short 2^16-1: 65535A registered port is one assigned by the Internet Corporation for Assigned Name...
分类：
Web程序 时间：
2015-05-01 22:33:53
阅读次数：
168
【题目】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,...
分类：
其他好文 时间：
2015-04-28 11:34:29
阅读次数：
102
题目链接：HDU - 1506A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may h...
分类：
其他好文 时间：
2015-04-27 01:52:18
阅读次数：
123
No.1Maximum SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest sum.e.g.[?2,1,?3,4,?1,2,1,?5,4...
分类：
其他好文 时间：
2015-04-26 09:09:23
阅读次数：
111
目录目录
题目
思路一
思路二题目Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.
Above is a histogram where...
分类：
其他好文 时间：
2015-04-23 13:33:11
阅读次数：
158
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,...
分类：
其他好文 时间：
2015-04-23 12:51:25
阅读次数：
102
