[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，满10进1，如果判断最后总位数不变，返回digits，如果判断最后总位数加了1位，还要重新建立一个数组num，返回num

public class Solution {
    public int[] plusOne(int[] digits) {
        int len=digits.length;
        int flag=1;//进制位
        for(int i=len;i>0;i--)
          {
              digits[i-1]=digits[i-1]+flag;
              if(digits[i-1]>9)
              {
                  digits[i-1]=digits[i-1]-10;
                  flag=1;
              }
              else flag=0;
          }
          if(flag==0) return digits;    //说明总的位数不变
          else
          { <pre name="code" class="java" style="color: rgb(51, 51, 51); font-size: 14px; line-height: 30px;"><span style="white-space:pre">		</span>int[] num=new int[len+1];

<span style="white-space:pre">		</span>num[0]=1;
              for(int i=0;i<len;i++)
          {
              num[i+1]=digits[i];
          }
          return num;
              
          }
              
              
              
    }
}