class Solution {
public:
static bool compare1(vector<int> & a, vector<int>& b){
return a[0] < b[0];
}
bool canAttendMeetings(vector<vector<int>>& intervals) {
sort(intervals.begin(),intervals.end(),compare1);
priority_queue<int, vector<int>, greater<int> > pq ;
for(int i=0; i<intervals.size();i++){
if(pq.empty()==false && pq.top() <= intervals[i][0]){
pq.pop();
pq.push(intervals[i][1]);
}else{
pq.push(intervals[i][1]);
}
}
printf("pq.size=%d\n",pq.size());
if(pq.size()>1){
return false;
}else{
return true;
}
}
};
252. Meeting Rooms
最新推荐文章于 2019-09-20 23:59:48 发布