Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 523fbc5

Browse files
Merge pull request codeisneverodd#5 from yongchanson/main
2022年03月24日 / yongchanson - solution add 2
2 parents 1a15697 + a3088d9 commit 523fbc5

File tree

2 files changed

+55
-2
lines changed

2 files changed

+55
-2
lines changed

‎level-1/로또의-최고-순위와-최저-순위.js‎

Lines changed: 30 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -80,4 +80,33 @@ function solution(lottos, win_nums) {
8080
if (min == 7) min = 6
8181
answer = [min, max]
8282
return answer;
83-
}
83+
}
84+
85+
//정답 5 - yongchanson
86+
function solution(lottos, win_nums) {
87+
//최고당첨개수 : maxPoint + basicPoint
88+
//최저당첨개수 : basicPoint
89+
90+
let basicPoint = 0;
91+
let maxPoint = 0;
92+
let answer = [];
93+
94+
lottos.forEach(function (lottos_item) {
95+
win_nums.forEach(function (win_nums_item) {
96+
if(lottos_item==win_nums_item) {
97+
basicPoint++;
98+
}
99+
})
100+
})
101+
102+
lottos.forEach(function (item) {
103+
if(item==0) {
104+
maxPoint++;
105+
}
106+
})
107+
108+
maxPoint+basicPoint >= 2 ? answer.push(7- maxPoint - basicPoint) : answer.push(6);
109+
basicPoint >= 2 ? answer.push(7- basicPoint) : answer.push(6);
110+
111+
return answer;
112+
}

‎level-1/없는-숫자-더하기.js‎

Lines changed: 25 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -14,4 +14,28 @@ function solution(numbers) {
1414
answer += numbers.includes(i) ? 0 : i
1515
}
1616
return answer;
17-
}
17+
}
18+
19+
//정답 3 - yongchanson
20+
function solution(numbers) {
21+
var answer = -1;
22+
23+
let arr = [0,1,2,3,4,5,6,7,8,9];
24+
let arr_sum = 0;
25+
let numbers_sum = 0;
26+
27+
for(i=0; i<arr.length/2; i++) {
28+
if(arr[i] == arr[arr.length -1 -i]) {
29+
arr_sum += arr[i]
30+
} else {
31+
arr_sum += arr[i] + arr[arr.length -1 -i]
32+
}
33+
}
34+
35+
for(i=0; i<numbers.length; i++) {
36+
numbers_sum += numbers[i]
37+
}
38+
39+
answer = arr_sum - numbers_sum;
40+
return answer;
41+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /