贪心算法——间隔任务规划——python

def get_max_intervalschedule(joblist):
    job_schedule = []
    num_job = len(joblist)
    joblist.sort(key = lambda x: x[2]) #按照结束时间进行排序
    
    for n in range(num_job):
        if not len(job_schedule):
            job_schedule.append(joblist[n])
        else:
            #job(n)是否与job_schedule中的jobs相容
            if job_schedule[-1][2] <= joblist[n][1]:
            #如果job_schedule中最后一个任务的结束时间小于joblist的开始时间
                job_schedule.append(joblist[n])
                
    return job_schedule

if __name__ == "__main__":
    joblist = [["e", 8, 10], ["b", 2, 5],
               ["c", 4, 7],["a", 1, 3],
               ["d", 6, 9]
               ]
    print(get_max_intervalschedule(joblist