LeetCode Top Interview Questions 66. Plus One (Java版； Easy)

welcome to my blog

LeetCode Top Interview Questions 66. Plus One (Java版; Easy)

题目描述

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.

Example 1:

Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.
Example 2:

Input: [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.

class Solution {
    public int[] plusOne(int[] digits) {
        int n = digits.length;
        for(int i=n-1; i>=0; i--){
            digits[i]++;
            if(digits[i]<10){
                return digits;
            }
            //digits[i]==10
            digits[i]=0;
        }
        //最高位产生了进位
        int[] arr = new int[n+1];
        arr[0] = 1;
        return arr;
    }
}

第一次做; 核心:处理进位

/*
个位数加一操作
核心:考虑进位, 最特殊的情况: 原始数组全是9, 个位数加1后, 数组长度得加1
细节:循环中, digits[i]=0和digits[i]++的配合
*/
class Solution {
    public int[] plusOne(int[] digits) {
        int n = digits.length;
        for(int i=n-1; i>=0; i--){
            digits[i]++;
            if(digits[i]!=10)
                return digits;
            digits[i]=0;
        }
        //here,说明输入的digts中全是9
        digits = new int[n+1];
        digits[0] = 1;
        return digits;
    }
}