LeetCode Plus One 66

66. Plus One

My Submissions

Question Editorial Solution

Total Accepted: 95281  Total Submissions: 285638  Difficulty: Easy

Given a non-negative number represented as an array of digits, plus one to the number.

The digits are stored such that the most significant digit is at the head of the list.

考虑数比较大 使用数组表示 加一  

由于题目没有0001的这种形式   减少特殊数据的处理

public class Solution {
    public int[] plusOne(int[] digits) {
        int carry = 0;
        int len = digits.length;
        int temp = 1;
        for(int i = len - 1; i >= 0; i--){
            temp = digits[i] + temp + carry;
            if(temp > 9){
                carry = 1;
            }
            else{
                carry = 0;
            }
            digits[i] = temp % 10;
            temp = 0;
        }
        if(carry == 1){
            int[] ans = new int[len+1];
            ans[0] = 1;
            for(int i = 1; i < len + 1; i++){
                ans[i] = digits[i - 1];
            }
            return ans;
        }
        return digits;
    }
}