136. Single Number Ⅰ
Description
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
思路
- 遍历: O(n2) O ( n 2 )
- 先排序后遍历: O(nlgn) O ( n l g n )
- 利用hashmap: