[LeetCode]66. Plus One

https://leetcode.com/problems/plus-one/

从后往前遍历，注意999999的情况即可。

public class Solution {    public int[] plusOne(int[] digits) {        if (digits == null || digits.length == 0) {            return digits;        }        int add = 1;        for (int i = digits.length - 1; add == 1 && i >= 0; i--) {            int temp = add;            temp = (digits[i] + add) / 10;            digits[i] = (digits[i] + add) % 10;            add = temp;        }        if (add != 0) {            digits = new int[digits.length + 1];            digits[0] = 1;        }        return digits;    }}