1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
| class Solution { public: vector<int> plusOne(vector<int>& digits) { int i = digits.size() - 1; int c = 0; ++digits[i]; while(digits[i] > 9 && i > 0) { c = digits[i] / 10; digits[i] %= 10; --i; digits[i] += c; } if(digits[i] > 9) { vector<int> ret(digits.size() + 1, 0); ret[0] = 1; return ret; } return digits; } };
|