Greedy algorithm--heap--arrange meeting room

Some projects occupy a conference room for presentations, and the conference room cannot accommodate the presentations of two projects at the same time.

Give you the start time and end time of each item (give you an array, which is a specific item),

You schedule the presentations and ask the conference room for the most presentations.

Return to this most presentation sessions.

 

Greedy: Sort by earliest end time

Guess you like

Origin http://43.154.161.224:23101/article/api/json?id=325005252&siteId=291194637