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 af9ec08

Browse files
Rename 'K번째수' 올바른 레벨 폴더로 이동 및 병합.
제보: @cruelladevil
1 parent b4fc601 commit af9ec08

File tree

2 files changed

+36
-35
lines changed

2 files changed

+36
-35
lines changed

‎level-1/K번째수.js

Lines changed: 36 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -2,32 +2,46 @@
22
//완벽한 정답이 아닙니다.
33
//정답 1 - codeisneverodd
44
function solution(array, commands) {
5-
var answer = [];
6-
answer = commands.map(cmd => {
7-
const arrCmd = array.slice(cmd[0] - 1, cmd[1]).sort((a, b) => a - b)
8-
return arrCmd[cmd[2] - 1]
9-
})
10-
return answer;
5+
var answer = [];
6+
answer = commands.map((cmd) => {
7+
const arrCmd = array.slice(cmd[0] - 1, cmd[1]).sort((a, b) => a - b);
8+
return arrCmd[cmd[2] - 1];
9+
});
10+
return answer;
1111
}
1212

1313
//정답 2 - jaewon1676
1414
function solution(array, commands) {
15-
var result = [];
16-
var temp = [];
17-
for(var i=0; i<commands.length; i++){
18-
temp = array.slice(commands[i][0] - 1, commands[i][1]).sort((a,b) => {returna-b})
19-
console.log(temp)
20-
result.push(temp[commands[i][2]-1])
21-
}
22-
returnresult
15+
var result = [];
16+
var temp = [];
17+
for(var i=0; i<commands.length; i++){
18+
temp = array.slice(commands[i][0] - 1, commands[i][1]).sort((a,b) => {
19+
returna-b;
20+
});
21+
console.log(temp);
22+
result.push(temp[commands[i][2]-1]);
2323
}
24-
24+
return result;
25+
}
26+
2527
// 정답 3 - prove-ability
2628
function solution(array, commands) {
27-
var answer = [];
28-
commands.forEach(([i, j, k]) => {
29-
const su = array.slice(i - 1, j).sort((a, b) => a - b)[k - 1]
30-
answer.push(su)
31-
})
32-
return answer;
33-
}
29+
var answer = [];
30+
commands.forEach(([i, j, k]) => {
31+
const su = array.slice(i - 1, j).sort((a, b) => a - b)[k - 1];
32+
answer.push(su);
33+
});
34+
return answer;
35+
}
36+
37+
//정답 4 - createhb21
38+
39+
function solution(array, commands) {
40+
let answer = [];
41+
for (let i = 0; i < commands.length; i++) {
42+
let eachCommand = commands[i];
43+
let slice = array.slice(eachCommand[0] - 1, eachCommand[1]);
44+
answer.push(slice.sort((a, b) => a - b)[eachCommand[2] - 1]);
45+
}
46+
return answer;
47+
}

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

Lines changed: 0 additions & 13 deletions
This file was deleted.

0 commit comments

Comments
(0)

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