LeetCode 732 我的日程安排表 III

732. 我的日程安排表 III

题目

思路

边界记录，扫描找最大。

代码

class MyCalendarThree {
public:
    map<int,int> mp;
    MyCalendarThree() {

    }
    
    int book(int start, int end) {
        mp[start]+=1;
        mp[end]-=1;

        int ans=0,sum=0;
        for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++)
        {
            sum+=it->second;
            if(ans<sum) ans=sum;
        }
        return ans;
    }
};

/**
 * Your MyCalendarThree object will be instantiated and called as such:
 * MyCalendarThree* obj = new MyCalendarThree();
 * int param_1 = obj->book(start,end);
 */