๐Ÿ“š Study/Baekjoon

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค Lv1 | ํ•ด์‹œ | ์™„์ฃผํ•˜์ง€ ๋ชปํ•œ ์„ ์ˆ˜

์œฐ๊ฐฑ 2026. 4. 5. 04:47

https://school.programmers.co.kr/learn/courses/30/lessons/42576

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

SW๊ฐœ๋ฐœ์ž๋ฅผ ์œ„ํ•œ ํ‰๊ฐ€, ๊ต์œก์˜ Total Solution์„ ์ œ๊ณตํ•˜๋Š” ๊ฐœ๋ฐœ์ž ์„ฑ์žฅ์„ ์œ„ํ•œ ๋ฒ ์ด์Šค์บ ํ”„

programmers.co.kr

 

 

def solution(participant, completion):
    part = {}
    for p in participant:
        if p not in part:
            part[p] = 1
        else:
            part[p] += 1
    comp = {}
    for c in completion:
        if c not in comp:
            comp[c] = 1
        else:
            comp[c] += 1
    
    
    for key, value in part.items():
        if key not in comp: # participant์— ์—†๋Š” ๊ฒฝ์šฐ
            return key
        else: # participant์— ์žˆ๋Š”๋ฐ ๋™๋ช…์ด์ธ์œผ๋กœ ์ˆ˜๊ฐ€ ๋‹ค๋ฅธ ๊ฒฝ์šฐ
            if value != comp[key]:
                return key