# 寻找数组中单独出现的数字
class Solution:
def find2nums(self,L):
if len(L) == 0:
return None
else:
i = 0
# 遍历数组
while i < (len(L)-1):
repeat = False
L_c = L[:] # 复制
for j in range(i+1,len(L_c)):
# 判断字符是否相等
if L[i] ^ L_c[j] == 0:
a = L.pop(i) # 删除重复的字符
b = L.pop(j-1) # 删除重复字符
repeat = True # 有重复的元素
break
# 只有i元素不重复,才往下迭代
# i元素重复,将其删除了后,i指向了下一个元素
if not repeat:
i = i + 1
return L
s = [6,2,2,3,4,6,4,1]
S = Solution()
S.find2nums(s)