LeetCode 136. Single Number（单个数字）

原题网址：https://leetcode.com/problems/single-number/

Given an 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?
方法：利用异或运算的特性。

public class Solution {
public int singleNumber(int[] nums) {
int single = 0;
for(int num: nums) single ^= num;
return single;
}
}