Coding-Su

문제[프로그래머스]로또의 최고 순위와 최저 순위정답def solution(lottos, win_nums): answer = [] count = [0, 0] for i in lottos: if i in win_nums: count[0] += 1 elif i == 0: count[1] += 1 if count[0] + count[1] 지워진 경우(0인 경우)에는 최고 순위인 경우 모두 맞는 숫자이고, 최저 순위인 경우는 모두 틀린 숫자임으로 두가지를 나눠서 배열에 저장하여 계산하였습니다.

문제프로그래머스 기사단원의 무기정답def solution(number, limit, power): answer = 0 iron = [1] for i in range(2, number+1): count = 2 for j in range(2, int(i**(1/2))+1): if i % j == 0: count += 1 if (j**2) != i: count += 1 iron.append(count) for i in range(0, number): if iron[i] > limit: iron[i] ..

정답def solution(n, m, section): answer = 0 wall = [0 for i in range(0, n)] for i in section: wall[i-1] = 1 for i in range(0, len(wall)): if wall[i] == 1: if i + m >= len(wall): answer += 1 break else: for j in range(0, m): wall[i+j] = 0 answer += 1 ..

정답def solution(nums): answer = 0 nums.sort() numList = [] for i in range(0, len(nums)-2): for j in range(i+1, len(nums)-1): for k in range( j+1, len(nums)): sum = nums[i] + nums[j] + nums[k] if sum % 2 == 1: numList.append(sum) for i in range(0, len(numList)): for j in range(2, numList[i]..

정답def solution(answers): answer = [] p1 = [1, 2, 3, 4, 5] p2 = [2, 1, 2, 3, 2, 4, 2, 5] p3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5] pc = [0, 0, 0] for i in range(0, len(answers)): if answers[i] == p1[i%5]: pc[0] += 1 if answers[i] == p2[i%8]: pc[1] += 1 if answers[i] == p3[i%10]: pc[2] += 1 if max(pc) == pc[0]: ..

def solution(k, m, score): answer = 0 score.sort(reverse = True) sameBox = [] while(len(score) >= m): box = [] for i in range(0, m): box.append(score[0]) score.pop(0) answer += min(box) * m * 1 return answer24개중 5개가 시간초가가 나왔다..ㅠㅠ 정답def solution(k, m, score): answer = 0 score.sort(reverse = True) sameBox = [] k = 0 while(len..