扑克牌的顺子

class Solution {
public:
    bool isContinuous( vector<int> q ) {
        if(q.empty())   return false;
        sort(q.begin(),q.end());
        int zero=0,n=q.size();
        for (int i = 0; i < n-1; i ++ )
        {
            if(q[i]==0) zero++;
            else
            {
                if((q[i]^q[i+1])==0) return false;//存在重复
                if(q[i+1]-q[i]-1>zero)  return false;//差值-1大于0的个数
                zero-=q[i+1]-q[i]-1;
            }
        }
        return true;
    }
};