LeetCode-Plus One

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.

题意：给出一个整形数组，将数组转化为一个数字后执行加一操作再返回一个数组；

解法：需要注意的是原数组的位数可能很长，因此若是将其转化为整形后执行加一操作可能会溢出；所以，我对其每一位进行进位相加操作，得出的结果入栈，栈底便是数字的最大位；

class Solution {
    public int[] plusOne(int[] digits) {
        Stack<Integer> num = new Stack<>();
        int digit = 0;//当前数字
        int cf = 0;//进位
        digit = digits[digits.length-1] + 1;
        cf = digit / 10;
        digit %= 10;
        num.push(digit);//入栈
        for(int i=digits.length-2; i>=0; i--){
            digit = digits[i] + cf;
            cf = digit / 10;
            digit %= 10;
            num.push(digit);
        }//根据进位得出当前位的数字
        if(cf != 0){
            num.push(cf);
        }//最大一位存在进位
        int result[] = new int[num.size()];
        int len = 0;
        while(!num.isEmpty()){
            result[len++] = num.pop();
        }      
        return result;
    }
}