https://programmers.co.kr/learn/courses/30/lessons/77484
μ½λ©ν μ€νΈ μ°μ΅ - λ‘λμ μ΅κ³ μμμ μ΅μ μμ
λ‘λ 6/45(μ΄ν 'λ‘λ'λ‘ νκΈ°)λ 1λΆν° 45κΉμ§μ μ«μ μ€ 6κ°λ₯Ό μ°μ΄μ λ§νλ λνμ μΈ λ³΅κΆμ λλ€. μλλ λ‘λμ μμλ₯Ό μ νλ λ°©μμ λλ€. 1 μμ λΉμ²¨ λ΄μ© 1 6κ° λ²νΈκ° λͺ¨λ μΌμΉ 2 5κ° λ²νΈ
programmers.co.kr
java
class Solution {
public int[] solution(int[] lottos, int[] win_nums) {
int[] answer = new int[2];
// 1,2,3,4,5,6-7(λ첨)
int[] level = {6,6,5,4,3,2,1};
int cnt = 0;
int win_cnt = 0;
for (int i = 0; i < win_nums.length; i++) {
if (lottos[i] == 0) {
win_cnt++;
}
for (int j = 0; j < lottos.length; j++) {
if (win_nums[i] == lottos[j]) {
cnt++;
}
}
}
answer[0] = level[cnt + win_cnt];
answer[1] = level[cnt];
return answer;
}
}
javascript
function solution(lottos, win_nums) {
const rank = [6,6,5,4,3,2,1];
let min = lottos.filter(lot => win_nums.includes(lot)).length; //2
let max = lottos.filter(lot => !lot).length; //2
const maxCount = min+max; // 4
return [rank[maxCount],rank[min]];
}
javaλ λλ€λ₯Ό μ΄μ©νμ¬ javascript μ²λΌ κΉλνκ² μ 리ν μ μμ§λ§ κΈ°λ³ΈκΈ°κ° μ€μνλ€κ³ μκ°.... (μμ§ μ°κΈ° μ΄λ ΅λ€ ...)
λ°μν
'μκ³ λ¦¬μ¦' μΉ΄ν κ³ λ¦¬μ λ€λ₯Έ κΈ
11μ 26μΌ 2λ¬Έμ - Java : Two pointers (0) | 2021.11.26 |
---|---|
11μ 22μΌ 1λ¬Έμ - Java : Array (0) | 2021.11.22 |
11μ 13μΌ 1λ¬Έμ - Java : Array (0) | 2021.11.13 |
11μ 3μΌ 1λ¬Έμ - Java : Array (0) | 2021.11.03 |
10μ 29μΌ 1λ¬Έμ - Java : Array (0) | 2021.10.29 |