LeetCode题解：Plus One

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

The digits are stored such that the most significant digit is at the head of the list.

题意：用一个数组代表一个非负整数，求该数+1后的值

解决思路：加1以后按照十进制算结果，如果最高位有进位则创建一个新的数组

代码：

public class Solution {    public int[] plusOne(int[] digits) {        digits[digits.length-1]+=1;        for(int i=digits.length-1;i>0;i--)        {            if(digits[i]==10)            {                digits[i]=0;                digits[i-1]+=1;            }        }        if(digits[0]==10)        {            int[] res=new int[digits.length+1];            digits[0]=0;            res[0]=1;            for(int i=1;i<res.length;i++)            {                res[i]=digits[i-1];            }            return res;        }        return digits;    }}