The 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...
分类：
其他好文 时间：
2015-01-07 12:57:33
阅读次数：
124
https://oj.leetcode.com/problems/plus-one/http://blog.csdn.net/linhuanmars/article/details/22365957publicclassSolution{
publicint[]plusOne(int[]digits){
if(digits==null||digits.length==0)
returnnull;
booleancarry=true;
for(inti=digits.length-1;i>=0;i--..
分类：
其他好文 时间：
2015-01-04 11:33:38
阅读次数：
130
这个题目与java里的BigInteger实现有些类似，可以参考其源码。
题目：
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 a...
分类：
其他好文 时间：
2014-12-29 21:24:42
阅读次数：
190
Plus OneGiven a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant dig...
分类：
其他好文 时间：
2014-12-10 00:23:51
阅读次数：
153
用数组保存的大数，每一个元素代表数的一位，将该数加1，求改变后的大小。...
分类：
其他好文 时间：
2014-11-30 07:10:14
阅读次数：
186
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
这道题其实让我意识到了我的英文水平还有待加强。。。。 题目如下： Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such tha...
分类：
其他好文 时间：
2014-11-24 00:41:04
阅读次数：
217
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-23 14:21:27
阅读次数：
140
题目描述：
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.
思路：先将list...
分类：
其他好文 时间：
2014-11-19 11:04:49
阅读次数：
175
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-15 01:20:40
阅读次数：
134
