0
点赞
收藏
分享

微信扫一扫

3.4_activity_selection_活动选择问题

流计算Alink 2022-02-14 阅读 17
# 保证活动是按结束时间排好序的
activities = [(1, 4), (3, 5), (0, 6), (5, 7), (3, 9), (5, 9), (6, 10), (8, 11), (8, 12), (2, 14), (12, 16)]
activities.sort(key=lambda x:x[1])


def activity_selection(a):
    """活动排程问题"""

    res = [a[0]]

    for i in range(1, len(a)):
        if a[i][0] >= res[-1][1]:
            res.append(a[i])

    return res

 

举报

相关推荐

0 条评论