【算法概论】贪心算法：区间划分问题

区间划分问题Interval Partitioning

问题描述：

       Lecture j starts at sj and finishes at fj

       Goal：find minimum number of classrooms to schedule all lectures so that no two occur at the same time in the same room.

       下面给出一个例子

标签：lectures,classrooms,教室,算法,讲座,时间,include,概论,贪心
来源： https://blog.csdn.net/t11383/article/details/89739290