【leetcode】【136】Single Number I

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 static  int singleNumber(int[] nums) {
        int res = nums[0];
        for(int i=1;i<nums.length;i++){
        res^=nums[i];
        }
        return res;
    }