삽질 중에 최고의 삽질 개발자

def solution(nums): nums_count = int(len(nums) / 2) set_nums = len(list(set(nums))) return nums_count if set_nums >= nums_count else set_nums

import datetime def solution(a, b): week_day = [ 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT', 'SUN' ] check_date = datetime.datetime(2016, a, b).weekday() return week_day[check_date]

def solution(k, score): k_arr = [] result = [] for number in score: if len(k_arr) < k: k_arr.append(number) result.append(min(k_arr)) else: if min(k_arr) < number: k_arr.sort(reverse=True) k_arr.pop() k_arr.append(number) result.append(min(k_arr)) else: result.append(min(k_arr)) return result

def solution(name, yearning, photo): result = [] for members in photo: score = 0 for member in members: if member in name: score += yearning[name.index(member)] result.append(score) return result

def solution(s): result = [] count = 0 for idx1 in range(len(s)): for idx2 in range(idx1-1, -1, -1): if s[idx1] == s[idx2]: count = idx1 - idx2 break else: count = 0 if count == 0: result.append(-1) else: result.append(count) return result

def solution(sides): sides.sort() return (sides[1] + sides[0]) - (sides[1] - sides[0] +1)

import math def solution(food): result1 = "" result2 = "" for idx in range(len(food)): check_food = math.floor(food[idx] / 2) if check_food > 0: result1 += f"{idx}"*check_food result2 = f"{idx}"*check_food + result2 return result1 + "0" + result2

def solution(numbers): result = [] for idx1 in range(len(numbers)): for idx2 in range(idx1+1, len(numbers)): result.append(numbers[idx1]+numbers[idx2]) return sorted(list(set(result)))

def solution(array, commands): return [ sorted(array[command[0]-1:command[1]])[command[2]-1] for command in commands ]

def solution(strings, n): strings.sort() return sorted(strings, key=lambda x:x[n])