Leetcode#66 Plus One

原题地址

 

简单模拟

 

代码：

 1 vector<int> plusOne(vector<int> &digits) {
 2         vector<int> sum(digits.size(), 0);
 3         int carry = 1;
 4         
 5         for (int i = digits.size() - 1; i >= 0; i--) {
 6             sum[digits.size() - 1 - i] = (digits[i] + carry) % 10;
 7             carry = (digits[i] + carry) / 10;
 8         }
 9         if (carry > 0)
10             sum.push_back(1);
11             
12         for (int i = 0; i * 2 < sum.size(); i++)
13             swap(sum[i], sum[sum.size() - 1 - i]);
14             
15         return sum;
16 }