[문제] Codility f&q에서 제공되는 데모 문제 Codility Your browser is not supported You should use a supported browser. Read more app.codility.com [코드] 시간복잡도 : O(N) * Python list의 in 연산자의 시간복잡도는 O(N)임 def solution(A): # write your code in Python 3.6 answer = 1 check = [0 for i in range(1000002)] A.sort() for num in A : if num > 0 : if answer == num : check[num] = 1 answer = answer + 1 elif check[num] != 1 : b..
