forked from sowon-dev/AlgorithmStudy_Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path_0066PlusOne.java
More file actions
45 lines (37 loc) ยท 1.3 KB
/
_0066PlusOne.java
File metadata and controls
45 lines (37 loc) ยท 1.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
package leetcodeEasyLevel;
import java.lang.reflect.Array;
import java.util.Arrays;
public class _0066PlusOne {
public static int[] plusOne(int[] digits) {
//๋ง์ง๋ง ์๋ฆฌ์๋ถํฐ ์์ํด์ 9๊ฐ ์๋ ๊ฒฝ์ฐ ์๋ฆฌ์๊ฐ +1 ์ฆ๊ฐํ๊ณ ํด๋น ์ซ์๋ 0์ด ๋๋ค
//9๊ฐ ์๋ ๊ฒฝ์ฐ ๋ง์ง๋ง์๋ฆฌ์๋ง +1์ฆ๊ฐ์ํจ ๋ค break ๋ก ์ข
๋ฃ
int cnt = 0;
for (int i = digits.length - 1; i >= 0; i--) {
if (digits[i] == 9) {
digits[i] = 0;
cnt++;
} else {
digits[i] = digits[i] + 1;
break;
}
}
//์๋ฆฌ์๊ฐ 1์ฆ๊ฐํ ๊ฒฝ์ฐ ์ฆ๊ฐํ ์ฒซ๋ฒ์งธ ์๋ฆฌ๋ ๋ฌด์กฐ๊ฑด 1์ด๋ค.
if (cnt == digits.length && digits[0] == 0) { //2
int[] tmp = new int[digits.length + 1]; //3
tmp[0] = 1;
for (int i = 0; i < digits.length; i++) {
tmp[i + 1] = digits[i];
}
return tmp;
}
return digits;
}
public static void main(String[] args) {
//int[] digits = {1,2,3};
//int[] digits = {4,3,2,1};
//int[] digits = {0};
//int[] digits = {9};
int[] digits = {9,9};
System.out.println(Arrays.toString(plusOne(digits)));
}
}