将区间划分成不重叠的最少组数

仔细看一下题目，可以抽象成就是一个点重叠区间的最大值

class Solution {
public:
    int minGroups(vector<vector<int>>& intervals) {
        vector<int> c(1000005, 0);
        int big = 0;
        for (int i = 0; i < intervals.size(); i++) {
            c[intervals[i][0]] += 1;
            c[intervals[i][1] + 1] -= 1;
            big = max(big, intervals[i][1]);
        }int now = 0; int ans = 0;
        for (int i = 1; i <= big; i++) {
            now += c[i];
            ans = max(ans, now);
        }return ans;
    }
};