Description
https://leetcode.com/problems/plus-one/
给定表示非负整数的非空数字数组,返回加上1的结果的数组表示。
Solving Ideas
时间复杂度:
O
(
n
)
O(n)
O(n)
空间复杂度:
O
(
n
)
O(n)
O(n)
Solution
class Solution {
public int[] plusOne(int[] digits) {
int n = digits.length;
int[] arr = new int[n];
System.arraycopy(digits, 0, arr, 0, n);
for (int i = n - 1; i >= 0; i--) {
if (arr[i] < 9) {
arr[i]++;
return arr;
}
arr[i] = 0;
}
int[] res = new int[n + 1];
res[0] = 1;
return res;
}
}