Leetcode | Plus One

Title: Given a number represented as an array of digits, plus one to the number.

idea: The traversal of an array needs to be done from right to left, and then the result exists in the temporary array as left-to-right. An array that traverses half the output before the array is reversed.
Code:

Class Solution {public
:
    vector<int> plusone (vector<int> &digits) {
        //Start typing your C/ C + + solution below
        //do not write int main () function
        vector<int> v;
        
        int next = 1;
        for (int i = Digits.size ()-1; I >= 0; i--)
        {
            int tmp = digits[i] + next;
            V.push_back (tmp%10);
            Next = TMP/10;
        }
        
        if (next! = 0)
        {
            v.push_back (next);
        }
        
        for (int i = 0; i < v.size ()/2; i++)
        {
            int t = v[i];
            V[i] = v[v.size ()-1-i];
            V[v.size ()-1-i] = t;
        }
        return v;
    }
};