물음표 살인마의 개발블로그

알고리즘 문제/CodeWar

Remove the minimum

BEstyle 2022. 9. 30. 18:46

DESCRIPTION:

The museum of incredible dull things

The museum of incredible dull things wants to get rid of some exhibitions. Miriam, the interior architect, comes up with a plan to remove the most boring exhibitions. She gives them a rating, and then removes the one with the lowest rating.

However, just as she finished rating all exhibitions, she's off to an important fair, so she asks you to write a program that tells her the ratings of the items after one removed the lowest one. Fair enough.

Task

Given an array of integers, remove the smallest value. Do not mutate the original array/list. If there are multiple elements with the same value, remove the one with a lower index. If you get an empty array/list, return an empty array/list.

Don't change the order of the elements that are left.

Examples

* Input: [1,2,3,4,5], output= [2,3,4,5]
* Input: [5,3,2,1,4], output = [5,3,2,4]
* Input: [2,2,1,2,1], output = [2,2,2,1]

def remove_smallest(tlist):
    numbers=tlist.copy()
    if numbers==[]:
        return []
    print(numbers)
    numbers.pop( numbers.index(min(numbers)))
    return numbers

'알고리즘 문제 > CodeWar' 카테고리의 다른 글

Duplicate Encoder  (0) 2022.10.04
Array.diff  (0) 2022.10.04
Count the divisors of a number  (0) 2022.09.30
Range Bit Counting  (0) 2022.09.30
Ascend, Descend, Repeat?  (0) 2022.09.29