LeetCode-Easy刷题(13) Plus One

Posted 2022-05-31 当以乐

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

You may assume the integer do not contain any leading zero, except the number 0 itself.

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

对一个按照顺序放在数组中的数进行加1操作.( 899 则  A[0]=8,A[1]=9,A[2]=9)

  public static int[] plusOne(int[] digits) 
        if(digits==null || digits.length<1)
            return digits;
        
        int plus = 1;
        for (int i = digits.length-1; i >=0; i--) 
            int current = (digits[i] + plus) % 10;//当前位置
            plus = (digits[i] + plus) /10;//下一位

            digits[i] = current;

            if(plus == 0)//没有下一位
                return digits;
            
        
        //越位
        int[] bigOne = new int[digits.length+1];
        bigOne[0] = 1;
        return bigOne;