LeetCode_66. Plus One

66. Plus One

Easy

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.

package leetcode.easy;

public class PlusOne {
	@org.junit.Test
	public void test() {
		int[] digits11 = { 1, 2, 3 };
		int[] digits21 = { 4, 3, 2, 1 };
		int[] digits12 = plusOne(digits11);
		int[] digits22 = plusOne(digits21);

		for (int i = 0; i < digits12.length; i++) {
			System.out.print(digits12[i]);
		}
		System.out.println();

		for (int i = 0; i < digits22.length; i++) {
			System.out.print(digits22[i]);
		}
		System.out.println();
	}

	public int[] plusOne(int[] digits) {
		for (int i = digits.length - 1; i >= 0; i--) {
			if (digits[i] != 9) {
				digits[i]++;
				break;
			} else {
				digits[i] = 0;
			}
		}

		if (digits[0] != 0) {
			return digits;
		} else {
			int[] result = new int[digits.length + 1];
			result[0] = 1;
			return result;
		}
	}
}