leetcode

0 class Solution {

1 public:

2 vector<int> plusOne(vector<int> &digits) {

3 vector<int> res;

4

5 int add = 1;

6 for (int i = digits.size() - 1; i >= 0 || add; i--) {

7 if (i >= 0) add += digits[i];

8 res.push_back(add % 10);

9 add /= 10;

10 }

11 reverse(res.begin(), res.end());

12 return res;

13 }

14 };