[프로그래머스] 1단계 - K번째수 (javascript)

https://school.programmers.co.kr/learn/courses/30/lessons/42748

프로그래머스

 

---

 

이중 for문

function solution(array, commands) {
    const answer = []

    for(let i = 0; i < commands.length; i ++) {
        const temp = []
        const start = commands[i][0] - 1
        const end = commands[i][1] - 1
        const pick = commands[i][2] - 1

        for(let j = start; j <= end; j ++) {
            temp.push(array[j])
        }
        
        answer.push(temp.sort((a, b) => a - b)[pick])
    }

    return answer
}

 

sort()

function solution(array, commands) {
    const answer = []

    for(let i = 0; i < commands.length; i ++) {
        const temp = []
        const start = commands[i][0] - 1
        const end = commands[i][1]
        const pick = commands[i][2] - 1

        answer.push(array.slice(start, end).sort((a, b) => a - b)[pick])
    }

    return answer
}

 

---

다른 사람의 풀이

map(), 구조 분해 할당

function solution(array, commands) {
    const newArray = commands.map(command => {
        const [start, end, pick] = command
        return array.slice(start - 1, end).sort((a, b) => a - b)[pick - 1]
    })

    return newArray
}