Skip to content

Commit 2cda62e

Browse files
authored
Merge pull request #935 from AlgorithmWithGod/suyeun84
[20250920] PGM / LV3 / N으로 표현 / 김수연
2 parents 4bcf1d9 + 40eabd2 commit 2cda62e

File tree

1 file changed

+40
-0
lines changed

1 file changed

+40
-0
lines changed
Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
```java
2+
import java.util.*;
3+
4+
class Solution {
5+
public int solution(int N, int number) {
6+
if (N == number) return 1;
7+
List<HashSet<Integer>> dp = new ArrayList<>();
8+
9+
for (int i = 0; i <= 8; i++) {
10+
dp.add(new HashSet<>());
11+
}
12+
13+
dp.get(1).add(N);
14+
15+
for (int i = 2; i <= 8; i++) {
16+
// 순수한 수
17+
StringBuilder sb = new StringBuilder();
18+
for (int j = 0; j < i; j++) {
19+
sb.append(N);
20+
}
21+
dp.get(i).add(Integer.parseInt(sb.toString()));
22+
// 사칙연산한 수
23+
for (int j = 0; j < i; j++) {
24+
int k = i - j;
25+
for (int num1 : dp.get(j)) {
26+
for (int num2 : dp.get(k)) {
27+
dp.get(i).add(num1+num2);
28+
dp.get(i).add(num1-num2);
29+
dp.get(i).add(num1*num2);
30+
if (num2 != 0) dp.get(i).add(num1/num2);
31+
}
32+
}
33+
}
34+
if (dp.get(i).contains(number)) return i;
35+
}
36+
37+
return -1;
38+
}
39+
}
40+
```

0 commit comments

Comments
 (0)