Plus One

来源:互联网 发布:淘宝用打印机什么牌子 编辑:程序博客网 时间:2024/05/01 13:46

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

class Solution {public:    vector<int> plusOne(vector<int> &digits)    {        int len = digits.size();        int i;        int a[len+1];        memset(a,0,sizeof(a));        int carry = 1;        for(i=0;i<len;i++)        {            a[len-i] += (carry + digits[len-i-1])%10;            carry     = (carry + digits[len-i-1])/10;        }        if(carry == 0)        {            for(i=0;i<len;i++)            digits[i] = a[i+1];            return digits;        }        else        {            a[0] = 1;            for(i=0;i<len;i++)            digits[i] = a[i];            digits.push_back(a[len]);            return digits;        }    }};


0 0
原创粉丝点击