题解 | 扑克牌顺子

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param numbers int整型vector 
     * @return bool布尔型
     */
    bool IsContinuous(vector<int>& numbers) {
        sort(numbers.begin(),numbers.end());
        int left = 0;
        while(numbers[left] == 0 ){
            left ++;
        }
        int pre = numbers[left];
        cout<<pre;
        for(int i = left + 1; i < numbers.size(); i++){
            int curr = numbers[i];
            if(curr == pre) return false;
            while(curr - pre != 1 && left != 0){
                left --;
                pre = pre + 1;    
            }
            
            if(curr - pre != 1) return false;
            pre = curr;
        }
        return true;
    }
};