LeetCode66.加一(Java实现)

链接:https://leetcode-cn.com/problems/plus-one/

class Solution {
    public int[] plusOne(int[] digits) {
        int carry=1;
        for(int i=digits.length-1;i>=0;i--){
            int sum=digits[i]+carry;
            digits[i]=sum%10;
            carry=sum/10;
            if(carry==0){
                return digits;
            }
        }
        int[] nums=new int[digits.length+1];
        nums[0]=1;
        return nums;
    }
}

 

你可能感兴趣的:(LeetCode编程题)