Package g1201_1300.s1235_maximum_profit_in_job_scheduling

Class Solution

java.lang.Object

g1201_1300.s1235_maximum_profit_in_job_scheduling.Solution

public class Solution
extends Object

1235 - Maximum Profit in Job Scheduling.<p>Hard</p> <p>We have <code>n</code> jobs, where every job is scheduled to be done from <code>startTime[i]</code> to <code>endTime[i]</code>, obtaining a profit of <code>profit[i]</code>.</p> <p>You&rsquo;re given the <code>startTime</code>, <code>endTime</code> and <code>profit</code> arrays, return the maximum profit you can take such that there are no two jobs in the subset with overlapping time range.</p> <p>If you choose a job that ends at time <code>X</code> you will be able to start another job that starts at time <code>X</code>.</p> <p><strong>Example 1:</strong></p> <p><strong><img src="https://assets.leetcode.com/uploads/2019/10/10/sample1_1584.png" alt="" /></strong></p> <p><strong>Input:</strong> startTime = [1,2,3,3], endTime = [3,4,5,6], profit = [50,10,40,70]</p> <p><strong>Output:</strong> 120</p> <p><strong>Explanation:</strong> The subset chosen is the first and fourth job. Time range [1-3]+[3-6] , we get profit of 120 = 50 + 70.</p> <p><strong>Example 2:</strong></p> <p><strong><img src="https://assets.leetcode.com/uploads/2019/10/10/sample22_1584.png" alt="" /></strong></p> <p><strong>Input:</strong> startTime = [1,2,3,4,6], endTime = [3,5,10,6,9], profit = [20,20,100,70,60]</p> <p><strong>Output:</strong> 150</p> <p><strong>Explanation:</strong> The subset chosen is the first, fourth and fifth job. Profit obtained 150 = 20 + 70 + 60.</p> <p><strong>Example 3:</strong></p> <p><strong><img src="https://assets.leetcode.com/uploads/2019/10/10/sample3_1584.png" alt="" /></strong></p> <p><strong>Input:</strong> startTime = [1,1,1], endTime = [2,3,4], profit = [5,6,4]</p> <p><strong>Output:</strong> 6</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= startTime.length == endTime.length == profit.length <= 5 * 10⁴</code></li> <li><code>1 <= startTime[i] < endTime[i] <= 10⁹</code></li> <li><code>1 <= profit[i] <= 10⁴</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	jobScheduling(int[] startTime, int[] endTime, int[] profit)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

jobScheduling

public int jobScheduling(int[] startTime,
 int[] endTime,
 int[] profit)