Leetcode - Single Number

https://leetcode.com/problems/single-number/

Given a non-empty 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?

Example 1:

Input: [2,2,1]
Output: 1

Given a number, use any number to do xor for it twice and it still remains.

So in this array, there are many elements appearing twice and only one single. Running xor for every number, the left one is the single one.

func singleNumber(nums []int) int {
    xor := nums[0]
    for i := 1; i < len(nums); i++ {
        xor ^= nums[i]
    }
    return xor
}

• 相关文章
• 全局相关文章