StarWalker

Where my heart will take me

0%

Leetcode066-plusOne

Posted on Edited on In Views: Valine:
Solution Report of LeetCode Acceptted

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

Example 1:

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

Example 2:

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

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
class Solution {
    public int[] plusOne(int[] digits) {
        for (int i = digits.length -1; i >= 0; i--){
            if (i == 0){
                if (digits[i] == 9){
                    int[] res = new int[digits.length+1];
                    res[0] = 1;
                    for (int j = 1; j < res.length; j++) res[j] =0;
                    return res;
                }
                else{
                    digits[0] += 1;
                    break;
                }
            }            
            if (digits[i] == 9){
                digits[i] = 0;
            }
            else {
                digits[i] += 1;
                break;
            }
        }
        return digits;
    }
}