题解 | #三角形最小路径和#

class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param triangle int整型vector<vector<>>
     * @return int整型
     */
    int f[1001][1001];
    int minTrace(vector<vector<int> >& a) {
        // write code here
        int RowLen = a.size();
        int ColLen = a[RowLen-1].size();
        for (int i = 0; i < ColLen; i++) f[RowLen - 1][i] = a[RowLen - 1][i];
        for (int i = RowLen - 2; i >= 0; i--) {
            for (int j = 0; j <= i; j++) {
                f[i][j] = (f[i + 1][j] < f[i + 1][j + 1] ? f[i + 1][j] : f[i + 1][j + 1]) +
                          a[i][j];
            }
        }
         printf("%d %d\n",RowLen,ColLen);
        for(int i=0;i<RowLen;i++){
            for(int j=0;j<=i;j++){
                printf("%d ",f[i][j]);
            }
            printf("\n");
        }
        return  f[0][0];


    }
};