TreeviewCopyright © aleen42 all right reserved, powered by aleen42

Activity-Selection Problem(活動選擇) Back


  • 給定一系列活動的開始時間和結束時間, 求出如何安排活動, 才能盡可能地安排最多的活動.

Greedy Solution

  • 每次我們都選擇剩下最快完成的事件
  • 上面情況的最優解: 1, 4, 8, 11
Empty Comments
Sign in GitHub

As the plugin is integrated with a code management system like GitLab or GitHub, you may have to auth with your account before leaving comments around this article.

Notice: This plugin has used Cookie to store your token with an expiration.