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
46
47
48
49
50
51
52
53
54
55
56
|
package algorithm.programmers.level1;
public class LottoMaxAndMin {
class Solution {
public int[] solution(int[] lottos, int[] win_nums) {
int[] answer = new int[2];
int winCount = 0 ;
int zeroCount = 0 ;
for (int lotto: lottos) {
if(lotto == 0 ){
zeroCount++;
continue;
}
for (int win_num: win_nums) {
if(lotto == win_num){
winCount++;
continue;
}
}
}
answer[0] = grade(winCount + zeroCount);
answer[1] = grade(winCount);
return answer;
}
public int grade(int count){
int grade = 0;
switch (count){
case 1:
grade = 6;
break;
case 2:
grade = 5;
break;
case 3:
grade = 4;
break;
case 4:
grade = 3;
break;
case 5:
grade = 2;
break;
case 6:
grade = 1;
break;
default:
grade = 6;
break;
}
return grade;
}
}
}
|
cs |
'코테 > 프로그래머스' 카테고리의 다른 글
[프로그래머스] 기능 개발(JAVA) (0) | 2022.03.10 |
---|---|
[프로그래머스] 숫자 문자열과 영단어(JAVA) (0) | 2022.03.03 |
[프로그래머스] 신고 결과 받기(JAVA) (0) | 2022.02.18 |
더 맵게 (0) | 2021.01.21 |
주식 가격 (0) | 2021.01.07 |