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?
1 public class Solution { 2 public int singleNumber(int[] nums) { 3 int result = 0; 4 for(int i = 0 ; i<nums.length ; i++ ){ 5 result ^= nums[i]; 6 } 7 return result; 8 } 9 }
原文：http://www.cnblogs.com/Juntaran/p/5428818.html