一個(gè)數(shù)組除了2個(gè)數(shù)字之外玩讳，所有數(shù)字都出現(xiàn)2次锄贼，找出出現(xiàn)1次的兩個(gè)數(shù)字
class Solution():
def onlynum(self,A):
res = 0
for i in A:
res ^= i
resString = str(bin(res)[2:])
index1 = len(resString)-1
for s in resString:
if s == 0:
index1 -=1
else:
break
groupA = []
groupB = []
for j in A:
if str(bin(j)[2:])[::-1][index1] == '1':
groupA.append(j)
else:
groupB.append(j)
numA = 0
for i in groupA:
numA ^= i
numB = 0
for i in groupB:
numB^= i
return numA,numB
s = Solution()
A = [2,4,3,6,3,2,5,5]
print(s.onlynum(A))