Leetcode66_Plus One_Eassy

标签：The   结果   col   and   sel   except   tin   ber   ica   

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

The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.

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

思路：digits[i] +1 有两种结果：（1）digits[i] < 9: 不进位 （2）digits[i] = 9: digits[i] = 0;

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

Leetcode66_Plus One_Eassy

标签：The   结果   col   and   sel   except   tin   ber   ica   

原文地址：https://www.cnblogs.com/Jessiezyr/p/10614339.html