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 0217192

Browse files
Merge pull request #40 from chaerin-dev/main
[2022年04月23日] 프로그래머스 풀이 추가
2 parents 94e38bc + bcde74e commit 0217192

File tree

3 files changed

+37
-0
lines changed

3 files changed

+37
-0
lines changed

‎level-1/K번째수.js‎

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -45,3 +45,18 @@ function solution(array, commands) {
4545
}
4646
return answer;
4747
}
48+
49+
// 정답 5 - chaerin-dev
50+
function solution(array, commands) {
51+
let t = commands.length;
52+
let answer = [];
53+
while (t--) {
54+
let command = commands.shift();
55+
answer.push(
56+
array.slice(command[0] - 1, command[1]).sort((a, b) => a - b)[
57+
command[2] - 1
58+
]
59+
);
60+
}
61+
return answer;
62+
}

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

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -137,3 +137,16 @@ function solution(lottos, win_nums) {
137137

138138
return [max, min]
139139
}
140+
141+
//정답 7 - chaerin-dev
142+
function solution(lottos, win_nums) {
143+
let zeroCount = 0;
144+
let winCount = 0;
145+
lottos.forEach((item) => {
146+
if (item === 0) zeroCount++;
147+
else if (win_nums.includes(item)) winCount++;
148+
});
149+
let maxRank = Math.min(7 - (winCount + zeroCount), 6);
150+
let minRank = Math.min(7 - winCount, 6);
151+
return [maxRank, minRank];
152+
}

‎level-1/부족한-금액-계산하기.js‎

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -46,4 +46,13 @@ function solution(price, money, count) {
4646
}
4747

4848
return sum < money ? 0 : sum - money;
49+
}
50+
51+
//정답 4 - chaerin-dev
52+
function solution(price, money, count) {
53+
let totalPrice = 0;
54+
for(let i=1; i<=count; i++){
55+
totalPrice += i * price;
56+
}
57+
return money > totalPrice ? 0 : totalPrice-money;
4958
}

0 commit comments

Comments
(0)

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