leetCode66. 加一
题目思路:
代码
class Solution {
public:vector<int> plusOne(vector<int>& digits) {reverse(digits.begin(), digits.end());int t = 1; //进位for(auto& x : digits){t = t + x;x = t % 10;t = t / 10;}if(t) digits.push_back(t);reverse(digits.begin(),digits.end());return digits;}
};