【LeetCode】66. Plus One

最新推荐文章于 2024-09-12 17:13:25 发布

weixin_30265103

最新推荐文章于 2024-09-12 17:13:25 发布

阅读量61

点赞数

文章标签：数据结构与算法 java

原文链接：http://www.cnblogs.com/yongh/p/10156804.html

版权

Difficulty: Easy

More:【目录】LeetCode Java实现

Description

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.

Intuition

读完题，首先要考虑到的是：1. 负数情况；2. 溢出情况；3.数字的顺序 123是[1,2,3]存放还是[3,2,1]存放。

本题比较简单，只要根据当前位的数字是否小于9来判断是否进位。详见代码。

Solution

public int[] plusOne(int[] digits) {
        if(digits==null)
            return digits;
        for(int i=digits.length-1; i>=0; i--){
            if(digits[i] < 9){
                digits[i]++;
                return digits;
            }
            digits[i]=0;
        }
        
        int[] newDigits=new int[digits.length+1];
        newDigits[0]=1;  //其余位的数都是0，如:999+1=1000
        return newDigits;
    }