Runtime: 990 ms (Top 41.71%) | Memory: 47.5 MB (Top 21.04%)

Author: AnasImloul

scripts/algorithms/M/Maximum Profit in Job Scheduling/Maximum Profit in Job Scheduling.py

@@ -1,3 +1,4 @@
+# Runtime: 990 ms (Top 41.71%) | Memory: 47.5 MB (Top 21.04%)
 class Solution:
     def jobScheduling(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int:
         n = len(startTime)
@@ -12,4 +13,4 @@ def recur(i):
             one = jobs[i][2] + recur(j)
             two = recur(i+1)
             return max(one, two)
-        return recur(0)
+        return recur(0)