leetCode练习（66）

题目：Plus One

难度：medium

问题描述：

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 int[] plusOne(int[] digits) {
        int jiwei=0;
        int temp;
        temp=digits[digits.length-1]+1;
        jiwei=temp/10;
        digits[digits.length-1]=temp%10;
        for(int i=digits.length-2;i>=0;i--){
        	temp=digits[i]+jiwei;
        	jiwei=temp/10;
        	digits[i]=temp%10;
        }
        if(jiwei==0){
        	return digits;
        }else{
        	int[]res=new int[digits.length+1];
        	res[0]=jiwei;
        	for(int i=0;i<digits.length;i++){
        		res[i+1]=digits[i];
        	}
        	return res;
        }
    }