leetcode846+set的使用，和循环的表示好

https://leetcode.com/problems/hand-of-straights/

class Solution {
public:
    bool isNStraightHand(vector<int>& hand, int W) {
        int n = hand.size();
        if(n%W != 0) return false;
        multiset<int>s(hand.begin(), hand.end());//有序
        multiset<int>::iterator it;
        for(int i=0; i<n/W; i++){ //遍历每一个group
            int st = *s.begin();
            for(int j=st; j<st+W; j++){ //检查一个group中连续的数字
                it = s.find(j);
                if(it==s.end()){ //没有
                    return false;
                }
                s.erase(it); //检查过了要删除
            }
        }
        return true;
    }
};