Java for LeetCode 066 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.

解题思路：

往一个用数组表示的数里面加1，注意下数据溢出即可，JAVA实现如下：

    public int[] plusOne(int[] digits) {

    	for(int i=digits.length-1;i>=0;i--){

    		digits[i]++;

    		if(digits[i]<=9)

    			return digits;

    		digits[i]=0;

    	}

    	int[] result=new int[digits.length+1];

    	result[0]=1;

    	return result;

    }

巴特西

Java for LeetCode 066 Plus One

最新文章

热门文章