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

vector 查找特定元素的位置 ：  vector<int>:: iterator element = find(nums.begin()+1,nums.end(),nums[0]);

vector 删除某一位置的元素： nums.erase(element);

vector 删除一个范围中的元素： nums.erase(nums.begin()+i, nums.begin()+j)

代码：

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int size = nums.size();
        while(nums.size()!=1){
            vector<int>:: iterator element = find(nums.begin()+1,nums.end(),nums[0]);
            if(element!=nums.end()){
                nums.erase(element);
                nums.erase(nums.begin());        
            }else
                break;    
        }
        return nums[0];
    }
};