LeetCode_Plus One

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

class Solution {
public:
    vector<int> plusOne(vector<int> &arr) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function        
        vector<int> ans;
        int size = arr.size();
    	if (size == 0)
    		return ans;
    	ans.resize(size);
    	int carry = 1;
    	int i = size - 1;
    	while (i >= 0)
    	{
    		int tmp = arr[i] + carry;
    		carry = tmp / 10;
    		tmp %= 10;		
    		ans[i] = tmp;            
    		//ans.push_back(tmp);
    		--i;
    	}
    	if (carry == 1)
    	{
    		ans.insert(ans.begin(), 1);
    	}
    	return ans;
    }
};