66. Plus One

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.
Seen this question in a real interview before?  
Difficulty:Easy
Total Accepted:289.1K
Total Submissions:722.7K
Contributor:LeetCode
Subscribe to see which companies asked this question.

Related Topics 

Similar Questions 
Multiply StringsAdd BinaryPlus One Linked List
Java	

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