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-14 12:18:20
阅读次数：
139
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-11-10 21:45:39
阅读次数：
191
题目：对一个用vector存的数字进行加1,然后返回加1后的值。一次就在oj上通过了。就是进位加上当前位如果大于9，那就当前位等于0；随后进位还为1的话就是在数组前面插入一个1；class Solution {public: vector plusOne(vector &digits) ...
分类：
其他好文 时间：
2014-11-10 01:07:46
阅读次数：
227
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-06 19:16:22
阅读次数：
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-06 19:12:07
阅读次数：
204
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-06 16:58:34
阅读次数：
138
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-04 14:28:59
阅读次数：
179
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.
一开始我误解了题目的意思，以为是新建一个...
分类：
其他好文 时间：
2014-10-31 22:16:05
阅读次数：
253
问题描述：
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.
代码：
...
分类：
其他好文 时间：
2014-10-28 17:49:25
阅读次数：
147
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.
题目描述：
输入一个数组表示的...
分类：
其他好文 时间：
2014-10-28 13:53:27
阅读次数：
157
