Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
41 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,41 @@ | ||
<h2><a href="https://leetcode.com/problems/ipo/">502. IPO</a></h2><h3>Hard</h3><hr><div><p>Suppose LeetCode will start its <strong>IPO</strong> soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increase its capital before the <strong>IPO</strong>. Since it has limited resources, it can only finish at most <code>k</code> distinct projects before the <strong>IPO</strong>. Help LeetCode design the best way to maximize its total capital after finishing at most <code>k</code> distinct projects.</p> | ||
|
||
<p>You are given <code>n</code> projects where the <code>i<sup>th</sup></code> project has a pure profit <code>profits[i]</code> and a minimum capital of <code>capital[i]</code> is needed to start it.</p> | ||
|
||
<p>Initially, you have <code>w</code> capital. When you finish a project, you will obtain its pure profit and the profit will be added to your total capital.</p> | ||
|
||
<p>Pick a list of <strong>at most</strong> <code>k</code> distinct projects from given projects to <strong>maximize your final capital</strong>, and return <em>the final maximized capital</em>.</p> | ||
|
||
<p>The answer is guaranteed to fit in a 32-bit signed integer.</p> | ||
|
||
<p> </p> | ||
<p><strong class="example">Example 1:</strong></p> | ||
|
||
<pre><strong>Input:</strong> k = 2, w = 0, profits = [1,2,3], capital = [0,1,1] | ||
<strong>Output:</strong> 4 | ||
<strong>Explanation:</strong> Since your initial capital is 0, you can only start the project indexed 0. | ||
After finishing it you will obtain profit 1 and your capital becomes 1. | ||
With capital 1, you can either start the project indexed 1 or the project indexed 2. | ||
Since you can choose at most 2 projects, you need to finish the project indexed 2 to get the maximum capital. | ||
Therefore, output the final maximized capital, which is 0 + 1 + 3 = 4. | ||
</pre> | ||
|
||
<p><strong class="example">Example 2:</strong></p> | ||
|
||
<pre><strong>Input:</strong> k = 3, w = 0, profits = [1,2,3], capital = [0,1,2] | ||
<strong>Output:</strong> 6 | ||
</pre> | ||
|
||
<p> </p> | ||
<p><strong>Constraints:</strong></p> | ||
|
||
<ul> | ||
<li><code>1 <= k <= 10<sup>5</sup></code></li> | ||
<li><code>0 <= w <= 10<sup>9</sup></code></li> | ||
<li><code>n == profits.length</code></li> | ||
<li><code>n == capital.length</code></li> | ||
<li><code>1 <= n <= 10<sup>5</sup></code></li> | ||
<li><code>0 <= profits[i] <= 10<sup>4</sup></code></li> | ||
<li><code>0 <= capital[i] <= 10<sup>9</sup></code></li> | ||
</ul> | ||
</div> |