[LeetCode] 252. Meeting Rooms 会议室

不是很难
#include
#include
#include
using namespace std;
bool MeetingRooms(vector<std::pair<int, int>> &vec)
{
sort(vec.begin(), vec.end(), [](std::pair<int, int> x, std::pair<int, int> y)
{return x.first < y.first; });
for (int i = 1; i < vec.size(); i++)
{
if (vec[i].first < vec[i - 1].second)
{
return false;
}
}
return true;
}
int main()
{
vector<std::pair<int, int>> vec{ {7,10},{2,4} };
cout << MeetingRooms(vec) << endl;;
system(“pause”);
return 0;
}