Leetcode (Plus One)

 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.

原题链接：https://leetcode.com/explore/learn/card/array-and-string/201/introduction-to-array/1148/

&esmp;就是将一个数以数组形式给出，比如1234，给出的形式为[ 1, 2, 3, 4]，要求你将这个数加一后，以数组形式返回。

 这道题和大数加一是一样的。先将数组逆序，然后加一，逐个判断是否需要进位。最后去掉前导0就行了

import java.util.Arrays;

class Solution {
	public int[] plusOne(int[] digits) {
		int N = digits.length;
		int[] arr = new int[N + 1];
		for (int i = 0; i < N; i++) {
			arr[i] = digits[N - 1 - i];
		}

		int index = 0;
		arr[0] += 1;
		int cur = arr[0];
		while (cur > 9 && index < arr.length) {
			arr[index] = cur % 10;
			arr[index + 1] += 1;
			cur = arr[++index];
		}

		N = arr.length;
		while (arr[N - 1] == 0)
			N--;
		int[] res = new int[N];
		for (int i = 0; i < N; i++)
			res[i] = arr[N - 1 - i];

		return res;
	}

	public static void main(String[] args) {
		int[] nums = {9, 9, 9, 9 };
		//int[] nums = {9, 9, 9, 0};
		Solution res = new Solution();
		int[] arr = res.plusOne(nums);
		System.out.println(Arrays.toString(arr));
	}