문제:
풀이 방법:
1 2 3 4 5 6 7 8 9 10 | def solution(participant,completion): participant.sort() completion.sort() if not bool(set(participant)-set(completion)): for i in range(len(completion)): if participant[i]!=completion[i]: return participant[i] else: answer=list(set(participant)-set(completion))[0] return answer | cs |
'Algorithm' 카테고리의 다른 글
[BOJ]11559. Puyo Puyo (0) | 2021.09.07 |
---|---|
[BOJ]3190. 뱀 (0) | 2021.08.19 |
[BOJ]1520. 내리막길 (0) | 2021.08.17 |
[BOJ]1987. 알파벳 (0) | 2021.08.10 |
[BOJ]14425. 문자열 집합 (0) | 2021.06.24 |