LeetCode 2: single-number II
Given an array of integers, every element appears three times except for one. Find that single one.
solution:
def singleNumber(self,A):
A.sort()
for i in range(0,len(A)):
if i%3=0 && A[i]!=A[i+1] && A[i]!=A[i+2kjk]:
return A[i-1]
if __name__ == '__main__':
print Solution().singleNumber([1, 1, 2, 2, 3])