[Programmers] 제일 작은 수 제거하기
Python def solution(arr): if len(arr) == 1: return [-1] else: arr.remove(min(arr)) return arr
Python def solution(arr): if len(arr) == 1: return [-1] else: arr.remove(min(arr)) return arr
Python def solution(arr1, arr2): answer = [] for i in range(len(arr1)): arr = [] for j in range(len(arr1[0])): arr.append...
Python ~~~python def solution(phone_number): answer = ‘*’ * (len(phone_number) - 4) + phone_number[-4:]
Python def solution(x): arr = list(str(x)) sum= 0 for i in arr: sum += int(i) if x % sum == 0: return True ...
Python def solution(num): answer = 0 while num != 1: answer += 1 if answer == 500: return -1 if num % 2 == 0: ...