LeetCode刷题笔记(66,加一,Easy)

class Solution {
    public int[] plusOne(int[] digits) {
        int n=digits.length-1;
        digits[n]++;
        if(digits[n] != 10){
            return digits;
        }else{
            while(n != 0 && digits[n] == 10){
                digits[n]=0;
                digits[n-1]++;
                n--;
            }
            if(digits[0] == 10){
                int[] array1= new int[digits.length+1];
                array1[0] = 1;
                for(int j=1;j

 

你可能感兴趣的:(LeetCode刷题笔记(66,加一,Easy))