136. Single Number

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: 

我的解法：利用异或操作，异或操作的特点是：相同的数做异或结果为0，0异或上任何数n结果为n。原因可自己拿数字试一下，总之用异或来找重复数字非常方便~

class Solution {
    public int singleNumber(int[] nums) {
        int result=0;
for(int i=0;i<nums.length;i++)
{
result=result^nums[i];
}
return result;
    }
}