leetcode 66. 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.

思路：

大整数加法

与大整数+1的思路一样，从数组后往前遍历，最低位模拟加一操作，并声明一个flag记录是否产生标志位，若无进位，则直接返回，若有进位，则后面各位依次模拟当前数+进位数的操作，来接着判断是否产生进位，无进位，则返回，有进位，则继续判断下一位。

实现：

public int[] plusOne(int[] digits) {
	int flag=0;
	for(int i=digits.length-1;i>=0;i--){
		if(i==digits.length-1){
			digits[i]=digits[i]+1;
			if(digits[i]>9){
				flag=1;
				digits[i]-=10;
			}else{
				return digits;
			}
		}else{
			digits[i]=digits[i]+flag;
			if(digits[i]>9){
				flag=1;
				digits[i]-=10;
			}else{
				return digits;
			}
		}
	}
	int[] arr=new int[digits.length+1];
	arr[0]=1;
	return arr;
}