one by one ◼◻◼◻

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 from collections import defaultdict def solution(id_list, report, k): singoed = set() answer = [] singoed_cnt = defaultdict(int) # 신고당한 횟수 mail_cnt = defaultdict(int) # 받은 메일의 수 report = list(set(report)) for item in report: person_A, person_B = item.split(" ")[0],item.split(" ")[1] singoed_cnt[person_B] +=1 if singoed_cnt[person_B] >= ..

프로그래머스에서 문제를 풀어보았다. queue를 이용해서 풀어보았다. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 from collections import deque def solution(progresses, speeds): jobque = deque(progresses) speedque = deque(speeds) time =0 answer = [] go = 0 while jobque: job = jobque.popleft() speed = speedque.popleft() while True: if job + speed*time >= 100: go+=1 break else: if go != 0: answer.append(go) go =0 t..