题目：
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?
链接： http://leetcode.com/problems/single-number/
2/18/2017, Java
1 public class Solution { 2 public int singleNumber(int[] nums) { 3 int value = 0; 4 for(int i = 0; i < nums.length; i++) { 5 value ^= nums[i]; 6 } 7 return value; 8 } 9 }
原文：http://www.cnblogs.com/panini/p/6414716.html