반응형
We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].
You're given the startTime , endTime and profit arrays, you need to output the maximum profit you can take such that there are no 2 jobs in the subset with overlapping time range.
If you choose a job that ends at time X you will be able to start another job that starts at time X.
반응형
'Leetcode' 카테고리의 다른 글
| Leetcode <Binary Search> 668. Kth Smallest Number in Multiplication Table 44.8% Hard (0) | 2020.04.11 |
|---|---|
| Leetcode <Binary Search> 287. Find the Duplicate Number 53.1% Medium (0) | 2020.04.10 |
| Leetcode <Sort> 1366. Rank Teams by Votes 50.6% Medium (0) | 2020.04.10 |
| Leetcode <Binary Search> 704. Binary Search 50.8% Easy (0) | 2020.04.10 |
| Leetcode <Sort> 242. Valid Anagram 백준 6996번 애너그램 (0) | 2020.04.05 |
댓글