[LeedCode OJ]#137 Single Number II

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