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...
分类：
其他好文 时间：
2014-11-29 07:05:11
阅读次数：
208
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 ...
分类：
其他好文 时间：
2014-11-29 06:59:16
阅读次数：
153
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu...
分类：
其他好文 时间：
2014-11-28 06:17:20
阅读次数：
252
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpo...
分类：
其他好文 时间：
2014-11-28 06:15:44
阅读次数：
173
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 ...
分类：
其他好文 时间：
2014-11-28 06:10:40
阅读次数：
259
问题描述：
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 ...
分类：
其他好文 时间：
2014-11-27 23:42:16
阅读次数：
239
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 ...
分类：
其他好文 时间：
2014-11-26 01:05:29
阅读次数：
166
Gray CodeThe gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the t...
分类：
其他好文 时间：
2014-11-25 22:47:02
阅读次数：
245
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
For example,
Given [0,1,0,2,1,0,1,3,2,1,2,1], ...
分类：
移动开发 时间：
2014-11-25 18:42:47
阅读次数：
202
Add Two NumbersYou are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes co...
分类：
其他好文 时间：
2014-11-25 14:09:53
阅读次数：
171
