Skip to content

Commit db79b24

Browse files
committed
issue #25 Between Two Sets w/ Explanation
1 parent 39fd5da commit db79b24

1 file changed

Lines changed: 11 additions & 1 deletion

File tree

src/hackerrank/BetweenTwoSets.java

Lines changed: 11 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,16 +8,22 @@ public class BetweenTwoSets {
88

99
public static int getTotalX(List<Integer> a, List<Integer> b) {
1010
// https://www.youtube.com/watch?v=gtvE0vxuvy8
11-
int cnt = 0, current = a.get(a.size() - 1), flag;
11+
int cnt = 0;
12+
int current = a.get(a.size() - 1);
13+
int flag; //a가 current의 약수가 아니거나 b가 current의 배수가 아닌 경우 flag 1 대입 후 break -> current를 1 더해준 뒤 다시 while문 반복 실행
1214

1315
while (current <= b.get(0)) {
1416
flag = 0;
17+
18+
//a 요소가 current의 약수면 flag=0 유지
1519
for (int i : a) {
1620
if (current % i != 0) {
1721
flag = 1;
1822
break;
1923
}
2024
}
25+
26+
//b 요소가 current의 배수면 flag=0 유지
2127
if (flag == 0) {
2228
for (int i : b) {
2329
if (i % current != 0) {
@@ -26,9 +32,13 @@ public static int getTotalX(List<Integer> a, List<Integer> b) {
2632
}
2733
}
2834
}
35+
36+
//위의 두 for문이 참이면 cnt 1씩 증가
2937
if (flag == 0) {
3038
cnt++;
3139
}
40+
41+
System.out.printf("cnt: %d, current: %d, flag: %d%n", cnt, current, flag);
3242
current++;
3343
}
3444
return cnt;

0 commit comments

Comments
 (0)