Skip to content

Commit 268a5a8

Browse files
Added README.md file for Maximum Profit in Job Scheduling
1 parent 1d5076e commit 268a5a8

File tree

1 file changed

+46
-0
lines changed
  • 1352-maximum-profit-in-job-scheduling

1 file changed

+46
-0
lines changed
Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
<h2><a href="https://leetcode.com/problems/maximum-profit-in-job-scheduling">Maximum Profit in Job Scheduling</a></h2> <img src='https://img.shields.io/badge/Difficulty-Hard-red' alt='Difficulty: Hard' /><hr><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>
2+
3+
<p>You&#39;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>
4+
5+
<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>
6+
7+
<p>&nbsp;</p>
8+
<p><strong class="example">Example 1:</strong></p>
9+
10+
<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/10/10/sample1_1584.png" style="width: 380px; height: 154px;" /></strong></p>
11+
12+
<pre>
13+
<strong>Input:</strong> startTime = [1,2,3,3], endTime = [3,4,5,6], profit = [50,10,40,70]
14+
<strong>Output:</strong> 120
15+
<strong>Explanation:</strong> The subset chosen is the first and fourth job.
16+
Time range [1-3]+[3-6] , we get profit of 120 = 50 + 70.
17+
</pre>
18+
19+
<p><strong class="example">Example 2:</strong></p>
20+
21+
<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/10/10/sample22_1584.png" style="width: 600px; height: 112px;" /> </strong></p>
22+
23+
<pre>
24+
<strong>Input:</strong> startTime = [1,2,3,4,6], endTime = [3,5,10,6,9], profit = [20,20,100,70,60]
25+
<strong>Output:</strong> 150
26+
<strong>Explanation:</strong> The subset chosen is the first, fourth and fifth job.
27+
Profit obtained 150 = 20 + 70 + 60.
28+
</pre>
29+
30+
<p><strong class="example">Example 3:</strong></p>
31+
32+
<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/10/10/sample3_1584.png" style="width: 400px; height: 112px;" /></strong></p>
33+
34+
<pre>
35+
<strong>Input:</strong> startTime = [1,1,1], endTime = [2,3,4], profit = [5,6,4]
36+
<strong>Output:</strong> 6
37+
</pre>
38+
39+
<p>&nbsp;</p>
40+
<p><strong>Constraints:</strong></p>
41+
42+
<ul>
43+
<li><code>1 &lt;= startTime.length == endTime.length == profit.length &lt;= 5 * 10<sup>4</sup></code></li>
44+
<li><code>1 &lt;= startTime[i] &lt; endTime[i] &lt;= 10<sup>9</sup></code></li>
45+
<li><code>1 &lt;= profit[i] &lt;= 10<sup>4</sup></code></li>
46+
</ul>

0 commit comments

Comments
 (0)