136. Single Number
- Total Accepted: 167202
- Total Submissions: 320990
- Difficulty: Easy
- Contributors: Admin
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
Code
class Solution(object):
def singleNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
res = 0
for n in nums:
res ^= n
return res
Idea
A XOR B XOR A= B