[Leetcode刷题]Plus One

下周Google面试T.T

决定先刷Google的题目好啦~

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.

Solutions

public class Solution {
public int[] plusOne(int[] digits) {
int[] result = new int[digits.length];
int carry = 1;
for(int i = digits.length - 1; i >= 0; i--){

result[i] = (digits[i] + carry)%10;
carry = (digits[i] + carry)/10;
}

if(carry == 1){
int[] resultCarry = new int[digits.length + 1];
System.arraycopy(result, 0, resultCarry, 1, result.length);
resultCarry[0] = 1;
return resultCarry;
}else{
return result;
}
}
}