LeetCode/120.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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <vector>
#include <iostream>

using namespace std;

class Solution {
public:
    int minimumTotal(vector<vector<int> >& triangle) {
        int n = triangle.size();

        vector<int> v[2];
        v[0].resize(n);
        v[1].resize(n);

        v[0][0] = triangle[0][0];

        for(int i = 1; i < n; ++i)
        {
            vector<int>& vFrom = v[1 - (i % 2)];
            vector<int>& vTo = v[i % 2];

            vTo[0] = vFrom[0] + triangle[i][0];
            cout << vTo[0] << "|";

            for(int j = 1; j < i; ++j)
            {
                vTo[j] =  triangle[i][j] + (vFrom[j] < vFrom[j-1] ? vFrom[j] : vFrom[j-1]);
                cout << vTo[j] << "|";
            }

            //vTo[i] = vFrom[i - 1] + triangle[i][i - 1];
            vTo[i] = vFrom[i - 1] + triangle[i][i];
            cout << vTo[i] << endl;
        }

        int min = 2100000000;
        vector<int>& vRet = ((n - 1) % 2 == 0 ? v[0] : v[1]);
        for(int i = 0; i < n; ++i)
        {
            cout << vRet[i] << "|";
            if(vRet[i] < min)min = vRet[i];
        }

        return min;
    };
};

int main()
{
    Solution s;

    vector< vector<int> > v;

    int n, t;
    cin >> n;
    v.resize(n);

    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j <= i; ++j)
        {
            cin >> t;
            v[i].push_back(t);
        }
    }

    cout << s.minimumTotal(v) << endl;

    return 0;
}