Package g1401_1500.s1494_parallel_courses_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1494 - Parallel Courses II.

    Hard

    You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given an array relations where <code>relationsi = prevCourse<sub>i</sub>, nextCourse<sub>i</sub></code>, representing a prerequisite relationship between course <code>prevCourse<sub>i</sub></code> and course <code>nextCourse<sub>i</sub></code>: course <code>prevCourse<sub>i</sub></code> has to be taken before course <code>nextCourse<sub>i</sub></code>. Also, you are given the integer k.

    In one semester, you can take at most k courses as long as you have taken all the prerequisites in the previous semester for the courses you are taking.

    Return the minimum number of semesters needed to take all courses. The testcases will be generated such that it is possible to take every course.

    Example 1:

    Input: n = 4, dependencies = [2,1,3,1,1,4], k = 2

    Output: 3

    Explanation: The figure above represents the given graph. In the first semester, you can take courses 2 and 3. In the second semester, you can take course 1. In the third semester, you can take course 4.

    Example 2:

    Input: n = 5, dependencies = [2,1,3,1,4,1,1,5], k = 2

    Output: 4

    Explanation: The figure above represents the given graph. In the first semester, you can take courses 2 and 3 only since you cannot take more than two per semester. In the second semester, you can take course 4. In the third semester, you can take course 1. In the fourth semester, you can take course 5.

    Example 3:

    Input: n = 11, dependencies = [], k = 2

    Output: 6

    Constraints:

    • 1 &lt;= n &lt;= 15

    • 1 &lt;= k &lt;= n

    • 0 &lt;= relations.length &lt;= n * (n-1) / 2

    • relations[i].length == 2

    • <code>1 <= prevCourse<sub>i</sub>, nextCourse<sub>i</sub><= n</code>

    • <code>prevCourse<sub>i</sub> != nextCourse<sub>i</sub></code>

    • All the pairs <code>prevCourse<sub>i</sub>, nextCourse<sub>i</sub></code> are unique.

    • The given graph is a directed acyclic graph.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minNumberOfSemesters(Integer n, Array<IntArray> relations, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait