LeetCode 66. Plus One（加1）

原题网址：https://leetcode.com/problems/plus-one/

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.

方法：按照运算规则。

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