-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLottos.java
36 lines (30 loc) · 937 Bytes
/
Lottos.java
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
import java.util.*;
class Lottos {
public int[] solution(int[] lottos, int[] win_nums) {
int[] answer = {0, 0};
int zeroCnt = 0;
Arrays.sort(lottos);
for(int i = 0; i < 6; i++) {
if(lottos[i] != 0) break;
zeroCnt++;
}
Arrays.sort(win_nums);
for(int j = 0; j < 6; j++) {
for(int k = zeroCnt; k < 6; k++) {
if(win_nums[j] != lottos[k]) continue;
answer[0]++;
answer[1]++;
}
}
answer[0] += zeroCnt;
for(int i = 0; i < 2; i++) {
if(answer[i] == 6) answer[i] = 1;
else if(answer[i] == 5) answer[i] = 2;
else if(answer[i] == 4) answer[i] = 3;
else if(answer[i] == 3) answer[i] = 4;
else if(answer[i] == 2) answer[i] = 5;
else answer[i] = 6;
}
return answer;
}
}