プログラマー-宝くじの最高と最低ランキング(Java)
10367 ワード
質問の表示
import java.util.ArrayList;
import java.util.List;
class Solution {
public int[] solution(int[] lottos, int[] win_nums) {
List<Integer> win_numbers = new ArrayList<>();
for (int num : win_nums) {
win_numbers.add(num);
}
int countZero = 0;
for (int lotto : lottos) {
if (lotto == 0) {
countZero++;
}
}
int countWinNumbers = 0;
for (int lotto : lottos) {
if (win_numbers.contains(lotto)) {
countWinNumbers++;
}
}
int[] numberAnswer = new int[2];
numberAnswer[0] = countWinNumbers + countZero;
numberAnswer[1] = countWinNumbers;
int[] answer = new int[2];
for (int i = 0; i < numberAnswer.length; i++) {
if (numberAnswer[i] == 6) {
answer[i] = 1;
}
if (numberAnswer[i] == 5) {
answer[i] = 2;
}
if (numberAnswer[i] == 4) {
answer[i] = 3;
}
if (numberAnswer[i] == 3) {
answer[i] = 4;
}
if (numberAnswer[i] == 2) {
answer[i] = 5;
}
if (numberAnswer[i] == 1 || numberAnswer[i] == 0) {
answer[i] = 6;
}
}
return answer;
}
}
Reference
この問題について(プログラマー-宝くじの最高と最低ランキング(Java)), 我々は、より多くの情報をここで見つけました https://velog.io/@plumwiserim/프로그래머스-로또의-최고-순위와-최저-순위テキストは自由に共有またはコピーできます。ただし、このドキュメントのURLは参考URLとして残しておいてください。
Collection and Share based on the CC Protocol