def solution(A):
len_A = len(A)
A = sorted(A)
min_A = 1 #無駄な負の値は考えないようにする工夫
i = 0
while i < len_A:
if A[i] == min_A:
min_A +=1
i +=1
return min_A
More than 1 year has passed since last update.
Register as a new user and use Qiita more conveniently
- You get articles that match your needs
- You can efficiently read back useful information
- You can use dark theme
List of users who liked
00