剑指offer之数组中只出现一次的数字

class  {
public:
    void FindNumsAppearOnce(vector<int> data,int* num1,int *num2) {
        sort(data.begin(), data.end());
        
        int flag = 0;
        
        for(int i = 0; i < data.size(); )
        {
            if(data[i] != data[i + 1])
            {
                if(flag == 0)
                {
                    *num1 = data[i];
                    flag = 1;
                    i++;
                    continue;
                }
                if(flag == 1)
                {
                    *num2 = data[i];
                    break;
                }
            }
            else
                 i = i + 2;
        }
    }
};