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: 4

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

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