csacademy - Contained Intervals

Contained Intervals

排序：前升序，后降序 -> 包含本区间的interval总在之前出现
成为被包含区间的两种情况：
1.后有相同区间
2.前有大区间

struct Interval {
    int l, r;
};

bool myFunc(Interval a, Interval b) {
    if(a.l==b.l) return a.r>b.r;
    return a.l<b.l;
}

bool operator==(const Interval& lhs, const Interval& rhs) {
    return (lhs.l == rhs.l) && (lhs.r == rhs.r);
}

int containedIntervals(vector<Interval>& intervals) {
    if(intervals.empty())   return 0;
    sort(intervals.begin(), intervals.end(), myFunc);
    int currentMaxR = intervals[0].r;
    int res = intervals.size() > 1 && intervals[0] == intervals[1] ? 0 : -1;
    int i = 0;
    for(;i < intervals.size()-1; ++i) {
        if(intervals[i] == intervals[i+1] || intervals[i].r <= currentMaxR)  ++res;
        currentMaxR = max(currentMaxR, intervals[i].r);
    }
    if(intervals[i].r <= currentMaxR)   ++res;
    return res;
}