CPP

136. Single Number leetcode solution in c++

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