SBS（4）-- 数组中只出现一次的数字Python

找出整型数组里除了两个数字以外，其它都出现了两次。要求时间复杂度是O(n) 空间复杂度是 O(1)

# -*- coding:UTF-8 -*-

'''
找出整型数组里除了两个数字以外，其它都出现了两次。要求时间复杂度是O(n) 空间复杂度是 O(1)
'''


class Solution(object):
    def findNumAPerOnce(self, data, length, num1, num2):
        if not data:
            return None
        resultOR = 0
        for i in range(length):
            resultOR = resultOR ^ data[i]

        indexOf1 = self.findFirstBitIs1(resultOR)

        for i in range(length):
            if self.isBit1(data[i], indexOf1):
                num1 = num1 ^ data[i]
            else:
                num2 = num2 ^ data[i]
        return num1, num2
    def findFirstBitIs1(self, num):
        indexBit = 0
        while num & 1 == 0:
            num = num >> 1
            indexBit = indexBit + 1
        return indexBit
    def isBit1(self, num, indexBit):
        num = num >> indexBit
        return num & 1

if __name__ == '__main__':
    nums = [2, 4, 3, 6, 3, 2, 5, 5]
    # nums = []
    target = 3
    print(Solution().findNumAPerOnce(nums, len(nums), 0, 0))