LeetCode OJ:Plus One

Plus One

 

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

class Solution {public:    vector<int> plusOne(vector<int> &digits) {        vector<int> result;        list<int> list;        if(digits.empty())return result;              list.push_front((digits[digits.size()-1]+1)%10);        int c=(digits[digits.size()-1]+1)/10;        for(int i=digits.size()-2;i>=0;i--){            list.push_front((digits[i]+c)%10);            c=(digits[i]+c)/10;        }        if(c)list.push_front(1);        return vector<int>(list.begin(),list.end());    }};