Singlenumber Python implementation

Single number

Given an array of integers, every element appears twice except for one. Find the single one.

Note:
Your algorithm should has a linear runtime complexity. Could you implement it without using extra memory?

Test instructions: In an array of integers, a number other than a number appears two times, asking for this to occur only once.

Requirements: The algorithm must be linear in time complexity and does not require additional space.

Idea: The main use of different or the nature. Exchange (A^B) ^c=a^ (b^c), and a^0=a, etc.

Realize:

　　

1 classSolution:2     #@param {integer[]} nums3     #@return {integer}4     defSinglenumber (Self, nums):5result =Nums[0]6          forIinchRange (1, Len (nums)):7Result ^=Nums[i]8         returnresult9             

Singlenumber Python implementation