LeetCode2.1.17(Plus One)

2.1.17 Plus One

描述

Given a number represented as an array of digits, plus one to the number.

//注意这里的数组长度比数据本身长度长一位，用来处理最高位进位情况public static void solution2_1_17(int[] array,int n){int flag=1;int i=array.length-2;while((i>=0)&&(flag==1)){array[i]+=1;if(array[i]!=10)flag=0;else{array[i]=0;i--;}}if(i<0){array[0]=1;for(int j=1;j<array.length;j++)array[j]=0;for(int j=0;j<array.length;j++)System.out.print(array[j]);}else{for(int j=0;j<array.length-1;j++){System.out.print(array[j]);}}}