antiSum 뭐야..
def solution(A):
return int(sum(A) == len(A)*(len(A)+1)//2)
def solution(A):
B = [i for i in range(1,len(A)+1)]
diff = set(B)-set(A)
return int(len(diff) == 0)
def solution(A):
N = len(A)
xorSum = 0
for i in range(1, N+1):
xorSum ^= i ^ A[i-1]
if xorSum == 0:
return 1
else:
return 0
def solution(A):
if max(A) != len(A) or len(set(A)) != len(A):
return 0
return 1