problem136

README

< Previous 　　　　　　　　　　　　　　　　 Next >

136. Single Number (Easy)

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

Example 2:

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

Related Topics

[Bit Manipulation] [Hash Table]

Similar Questions

1. Single Number II (Medium)
2. Single Number III (Medium)
3. Missing Number (Easy)
4. Find the Duplicate Number (Medium)
5. Find the Difference (Easy)