问题描述
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-08-31 23:05:42
阅读次数：
390
本文为senlie原创，转载请保留此地址：http://blog.csdn.net/zhengsenlie
Plus One
Total Accepted: 17614 Total
Submissions: 55852My Submissions
Given a non-negative number represented as an array ...
分类：
其他好文 时间：
2014-08-29 02:53:26
阅读次数：
223
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-08-25 14:42:24
阅读次数：
138
问题：数组模拟整数加1class Solution {public: vector plusOne(vector &digits) { int i,k=0; int a[100]; for(i=digits.size()-1;i>=0;i--) ...
分类：
其他好文 时间：
2014-08-06 22:20:12
阅读次数：
187
题目：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 i....
分类：
编程语言 时间：
2014-08-03 07:49:34
阅读次数：
246
The trick is, we can work on a reversed vector - learnt from EPI.class Solution {public: vector plusOne(vector &digits) { std::reverse(digit...
分类：
其他好文 时间：
2014-07-22 00:33:36
阅读次数：
223
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-07-21 10:00:12
阅读次数：
185
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-07-21 09:14:10
阅读次数：
168
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-07-18 16:17:10
阅读次数：
249
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-07-06 16:11:35
阅读次数：
170
