Algorithm : Programmers - k 번째 찾기

코일·2022년 1월 5일
0

algorithm

목록 보기
31/37
post-thumbnail

👉 문제

🤔생각해보기

👉 해결

def solution(array, commands):

    arr=[]
    ans = []
    for ii in range(len(commands)):
        for _ in range(len(commands[ii])):
            i = commands[ii][0]
            j = commands[ii][1]
            k = commands[ii][2]


        arr.append(sorted(array[i-1:j]))
        ans.append(arr[ii][k-1])

    return ans

🐱‍👤모범답안

def solution(array, commands):
    return list(map(lambda x:sorted(array[x[0]-1:x[1]])[x[2]-1], commands))

위가 아니라면

이런느낌으로..


def solution(array, commands):
    answer = []
    for com in commands:
        answer.append(sorted(array[com[0]-1:com[1]])[com[2]-1])
    return answer
profile
How do you get what you want?🤔🤔

0개의 댓글