You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2015-04-05 18:53:07
阅读次数：
110
Given a non-negative number represented as an array of digits, plus one to the number.
The digits are stored such that the most significant digit is at the head of the list.
class Solution {
p...
分类：
其他好文 时间：
2015-04-05 17:33:17
阅读次数：
89
目录目录
题目
思路
AC代码题目
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 number is 9534330.
Not...
分类：
其他好文 时间：
2015-04-05 13:22:34
阅读次数：
140
题目：
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it ...
分类：
其他好文 时间：
2015-04-04 21:16:34
阅读次数：
139
题目链接：largest-number
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
/**
*
Given a list of non negative integers, arrange them such that they form the largest n...
分类：
其他好文 时间：
2015-04-04 12:19:51
阅读次数：
146
题目链接：Largest Rectangle in Histogram
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.
...
分类：
其他好文 时间：
2015-04-03 17:18:59
阅读次数：
128
problem:
Given a non-negative number represented as an array of digits, plus one to the number.
The digits are stored such that the most significant digit is at the head of the list....
分类：
其他好文 时间：
2015-04-03 11:26:38
阅读次数：
160
SequenceTime Limit:6000MSMemory Limit:65536KTotal Submissions:7762Accepted:2565DescriptionGiven m sequences, each contains n non-negative integer. Now...
分类：
其他好文 时间：
2015-04-02 20:49:59
阅读次数：
170
problem：
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which
minimizes the sum of all numbers along its path.
Note: You can only move e...
分类：
其他好文 时间：
2015-04-02 16:27:56
阅读次数：
131
problem：
Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given 1->2->3->4->5->NULL and k = 2,
return 4->5->1->2->3->NULL.
Hide Tags
L...
分类：
其他好文 时间：
2015-04-02 10:31:03
阅读次数：
117
