136. 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?

Subscribe to see which companies asked this question.

思路一：

我的思路：暴力搜索 因为只有一个元素 是单个出现 所以 其他元素 左右两边必有一个元素与自己相等  

      只要找到，那一个左右都不相等的元素 即可

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        if(nums.size()<=1) return nums[0];
        sort(nums.begin(),nums.end());
        if(nums[0] != nums[1]) return nums[0];
        for(int i =0;i<nums.size()-1;i++){
            if(nums[i]!=nums[i-1] && nums[i]!=nums[i+1]) return nums[i];
        }
        return nums[nums.size()-1];
    }
};

思路二：

将所有元素依次做异或操作 相同的元素异或为0  最终剩下的元素就是single number

class Solution {
public:
    int singleNumber(int A[], int n) {
        
        //异或
        int elem = 0;
        for(int i = 0; i < n ; i++) {
            elem = elem ^ A[i];
        }
        
        return elem;
    }
};