leetcode--66. Plus One

题目：https://leetcode.com/problems/plus-one/#/description

class Solution {public:    vector<int> plusOne(vector<int>& digits) {        int t = 1;         for(int i = digits.size() - 1; i >= 0; -- i)        {            int a = digits[i] + t;             digits[i] = a % 10;             t = a / 10;         }         if(t == 1)            digits.insert(digits.begin(), 1);              return digits;    }};