LeetCode部分题解

LeetCode Algorithm部分.502

【502】 IPO

Suppose LeetCode will start its IPO 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 IPO. Since it has limited resources, it can only finish at most k distinct projects before the IPO. Help LeetCode design the best way to maximize its total capital after finishing at most k distinct projects.

You are given several projects. For each project i, it has a pure profit Pi and a minimum capital of Ci is needed to start the corresponding project. Initially, you have W capital. When you finish a project, you will obtain its pure profit and the profit will be added to your total capital.

To sum up, pick a list of at most k distinct projects from given projects to maximize your final capital, and output your final maximized capital.

Example 1:

Input: k=2, W=0, Profits=[1,2,3], Capital=[0,1,1].

Output: 4

Explanation: 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.
Note:
You may assume all numbers in the input are non-negative integers.
The length of Profits array and Capital array will not exceed 50,000.
The answer is guaranteed to fit in a 32-bit signed integer.

此题大意为实现资金的最大化。我是通过贪婪算法的思想实现的，每步尽量取得最大的利润。下面是我的实现

    static bool cmp1(pair<int, int> pc1, pair<int, int> pc2){
        return pc1.first < pc2.first;
    }
    static bool cmp2(pair<int, int> pc1, pair<int, int> pc2){
        return pc1.second < pc2.second;
    }
    int findMaximizedCapital(int k, int W, vector<int>& Profits, vector<int>& Capital) {
        vector<pair<int, int>> pc;
        pc.resize(Profits.size());
        for(int i = 0; i < Profits.size(); i++){
            pc[i].first = Profits[i];
            pc[i].second = Capital[i];
        }
        sort(pc.begin(),pc.end(),cmp1);
        sort(pc.begin(),pc.end(),cmp2);
        int sum = W;
        for(int i = 0; i < k; i++){
            for(int j = pc.size() - 1; j >= 0; j--){
                if(pc[j].second <= sum) {
                    sum+=pc[j].first;
                    pc.erase(pc.begin()+j);
                    break;
                }
            }
        }
        return sum;
    }

可能是算法还有一定缺陷，经过修改。33个样例中有5个无法通过，还希望大家批评指正。

下面我参考了其他人的算法，其负责度大约在O(nlogn)

struct Node {int profit, capital;};

    int findMaximizedCapital(int k, int W, vector<int>& Profits, vector<int>& Capital) {
        if(Profits.empty() || Capital.empty()) return W;
        vector<Node*> projects;
        for(int i = 0; i < Profits.size(); i++) 
            projects.push_back(new Node({Profits[i], Capital[i]}));
        multiset<int> pq;
        sort(projects.begin(), projects.end(), [&](Node* n1, Node* n2) {return n1->capital < n2->capital;});
        for(auto start = projects.begin(); k > 0; k--) {
            for(; start != projects.end() && (*start)->capital <= W; start++) {
                pq.insert((*start)->profit);
                if(pq.size() > k) pq.erase(pq.begin());
            } 
            if(pq.empty()) break;
            W += *pq.rbegin();
            pq.erase(prev(pq.end()));
        }
        return W;
    }