SingleNumber136 leetCode

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

最开始咱们使用map：

还有就是能够排序后比较，排序可能就不是线性的啦

而后看看大神是怎么写的：

源码：https://github.com/woshiyexinjie/leetcode-xin/tree/master/src/main/java/com/helloxin/leetcode/algorithms

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

有什么讨论的内容，能够加我公众号：