Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.
You may assume the integer do not contain any leading zero, except the number 0 itself.
The digits are stored such that the most significant digit is at the head of the list.
翻译:
给定一个非负整数,非空数组表示,给这个整数加一。返回数组形式。
您可以假设整数不包含任何前导零,除了数字0本身。
存储数字使得最高有效数字位于列表的头部。
思路:carry为进位标志,用string来逐一存储每一位的结果,由于存储结果顺序颠倒,最后将String转化为StringBuffer,用reverse方法倒序,最后先转化为char数组,再转为int数组,char转int要用到Character.getNumericValue。
public int[] plusOne(int[] digits) {
int carry = 1;
String s = new String();
for(int i=digits.length-1;i>=0;i--){
int result = digits[i] + carry;
if(result==10){
carry = 1;
result = 0;
s=s+String.valueOf(result);
}else{
s=s+String.valueOf(result);
carry=0;
}
if(i==0 && result==0){
s=s+"1";
}
}
String rev_ste = new StringBuffer(s).reverse().toString();
char[] final_char = rev_ste.toCharArray();
int[] final_int = new int[final_char.length];
for(int i =0;i<final_int.length;i++){
final_int[i] = Character.getNumericValue(final_char[i]);
}
return final_int;
}
答案思路:太巧妙了,自己体会吧。
public int[] plusOne(int[] digits) {
int n = digits.length;
for(int i=n-1; i>=0; i--) {
if(digits[i] < 9) {
digits[i]++;
return digits;
}
digits[i] = 0;
}
int[] newNumber = new int [n+1];
newNumber[0] = 1;
return newNumber;
}