Our department is sending n faculty members to an academic conference and
we are determined to cover as many meetings as possible.
We have a list of all the meetings, with their start and end times. All the meetings
are in adjacent rooms so no time is required to travel from one meeting to another.
This means that if the end time of one meeting is the same as the start time
of another meeting, a single person could cover both meetings from start to end.
Each element of the String[] meetings gives the start and end time of a meeting, separated
by a single space.
Each time is given in the form hh:mm and represents a time between 08:00 in the
morning and 08:00 in the evening inclusive.
Create a class Conference that contains a method coverage that is given n, the
number of faculty sent to the conference, and the String[] meetings listing the times
of all the meetings. The method returns the most meetings that we can cover by having at least one faculty member at the meeting from start to end.
|