Skip to content
#

array

Here are 1,624 public repositories matching this topic...

grandyang
grandyang commented May 30, 2019

 

There are n different online courses numbered from 1 to n. Each course has some duration(course length) tand closed on dth day. A course should be taken continuously for t days and must be finished before or on the dth day. You will start at the 1st day.

Given n online courses represented by pairs (t,d), your task is to find the maximal number of courses that can be taken.

Improve this page

Add a description, image, and links to the array topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the array topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.