We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent fa2b504 commit 09bbdf8Copy full SHA for 09bbdf8
java/066_Plus_One.java
@@ -0,0 +1,23 @@
1
+class Solution {
2
+ public int[] plusOne(int[] digits) {
3
+ return addToDigit(digits, digits.length - 1);
4
+ }
5
+
6
+ private int[] addToDigit(int[] digits, int index) {
7
+ if (index == -1) {
8
+ int[] newDigits = new int[digits.length + 1];
9
+ newDigits[0] = 1;
10
+ for (int i = 0; i < digits.length; i++) {
11
+ newDigits[i + 1] = digits[i];
12
13
+ return newDigits;
14
15
+ if (digits[index] == 9) {
16
+ digits[index] = 0;
17
+ return addToDigit(digits, index - 1);
18
+ } else {
19
+ digits[index]++;
20
+ return digits;
21
22
23
+}
0 commit comments