136. Single Number

Given an array of integers, every element appears twice except for one. Find that single one.

 

 

Bit Manipulation:

C++:

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int res = 0 ;
        for (int i : nums){
            res ^= i ;
        }
        return res ;
    }
};

 

 

java（1ms）：

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