题目描述:https://leetcode-cn.com/problems/single-number/description/
思路:
如果用循环解决,复杂度为 O ( n 2 ) O(n^2) O(n2)。如果用位运算(异或),则只需要一次遍历:
class Solution:
class Solution:
def singleNumber(self, nums: List[int]) -> int:
a = 0
for num in nums:
a = a ^ num
return a
异或运算有以下性质:
- 交换律: a ⊕ b = b ⊕ a a \oplus b = b \oplus a a⊕b=b⊕a
- 结合律: a ⊕ b ⊕ c = a ⊕ ( b ⊕ c ) = ( a ⊕ b ) ⊕ c a \oplus b \oplus c = a \oplus (b \oplus c) = (a \oplus b) \oplus c a⊕b⊕c=a⊕(b⊕c)=(a⊕b)⊕c
- 自反性: a ⊕ b ⊕ a = b a \oplus b \oplus a = b a⊕b⊕a=b
根据自反性,由于nums
中相同的数只有两个,所以可以将所有的数异或,即可得到只出现一次的数。