Skip to content

Commit eaffffb

Browse files
refactor 66
1 parent 46815c1 commit eaffffb

File tree

2 files changed

+7
-7
lines changed

2 files changed

+7
-7
lines changed

src/main/java/com/fishercoder/solutions/_66.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -20,14 +20,14 @@ public int[] plusOne(int[] digits) {
2020
return newNumber;
2121
}
2222
}
23-
23+
2424
public static class Solution2 {
25-
public int[] plusOne(int[] digits) {
25+
public int[] plusOne(int[] digits) {
2626
int len = digits.length;
2727
for (int i = len - 1; i >= 0; i--) {
2828
if (digits[i] == 9) {
29-
digits[i] = 0;
30-
} else {
29+
digits[i] = 0;
30+
} else {
3131
digits[i]++;
3232
return digits;
3333
}

src/test/java/com/fishercoder/_66Test.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@ public void test3() {
3535
digits = new int[]{2, 4, 9, 3, 9};
3636
assertArrayEquals(new int[]{2, 4, 9, 4, 0}, solution1.plusOne(digits));
3737
}
38-
38+
3939
@Test
4040
public void test4() {
4141
digits = new int[]{9, 9, 9, 9, 9};
@@ -47,11 +47,11 @@ public void test5() {
4747
digits = new int[]{8, 9, 9, 9, 9};
4848
assertArrayEquals(new int[]{9, 0, 0, 0, 0}, solution2.plusOne(digits));
4949
}
50-
50+
5151
@Test
5252
public void test6() {
5353
digits = new int[]{2, 4, 9, 4, 9};
5454
assertArrayEquals(new int[]{2, 4, 9, 5, 0}, solution2.plusOne(digits));
5555
}
56-
56+
5757
}

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy