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

解题思路
本题是将一个十位数按位存储到数组中，然后加一后将结果数组输出。主要的问题在如果有进位的情况需要特殊处理。

自己的代码

package leetcode;

import java.util.Arrays;

public class PlusOne {
	public int[] plusOne(int[] digits) {
		boolean addOne = false;
		for(int i = digits.length - 1; i >= 0; i--){
			int result = digits[i] + 1;
			if(result != 10) {
				digits[i] = result;
				break;
			}
			else{
				digits[i] = 0;
				if(i == 0) addOne = true;
			}
		}
		if(!addOne) return digits;
		else{
			int[] otherDigits = new int[digits.length+1];
			otherDigits[0] = 1;
			for(int i = 0; i < digits.length; i++)
				otherDigits[i+1] = digits[i];
			return otherDigits;
		}
    }
	
	public static void main(String[] args) {
		//int[] digits = {1, 2, 2};
		//int[] digits = {9};
		//int[] digits = {9, 9};
		int[] digits = {0};
		
		PlusOne po = new PlusOne();
		System.out.println(Arrays.toString(po.plusOne(digits)));
	}
}