LeetCode/122.cpp at master · chinawch007/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <vector>
#include <iostream>

using namespace std;

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.size() < 2)return 0;
        vector<int> vMax;
        vMax.resize(prices.size());
        for(int i = 0; i < vMax.size(); ++i)vMax[i] = 0;

        for(int i = 1; i < prices.size(); ++i)
        {
            for(int j = i - 1; j >= 0; --j)
            {
                if(prices[j] < prices[i])
                {
                    if( (j-1>=0 ? vMax[j-1] : 0) + prices[i] - prices[j] > vMax[i])
                    {
                        vMax[i] = (j-1>=0 ? vMax[j-1] : 0) + prices[i] - prices[j];
                        //此步骤忘了,注意编程前计划构思的完善性
                        //if(vMax[i-1] > vMax[i])vMax[i] = vMax[i -1];
                    }

                }
            }
            //错误,之前在上边
            if(vMax[i-1] > vMax[i])vMax[i] = vMax[i -1];
        }
        for(int i = 0; i < vMax.size(); ++i)cout << vMax[i] << "|";
        cout << endl;

        return vMax[prices.size() - 1];
    };
};

int main()
{
    Solution s;

    int n, t;
    vector<int> vi;
    cin >> n;
    for(int i = 0; i < n; ++i)
    {
        cin >> t;
        vi.push_back(t);
    }

    cout << s.maxProfit(vi) << endl;

    return 0;
}