triangle

题目描述

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

For example, given the following triangle

[
     [2],
    [3,4],
   [6,5,7],
  [4,1,8,3]
]

The minimum path sum from top to bottom is11(i.e., 2 + 3 + 5 + 1 = 11).

Note: 
Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.

Solution 1（动态规划）

// 给定一个三角形，找出从顶到底的最小路径和，每一步可以从上一行移动到下一行相邻的数字
//    [                   
//         [2],                 [2],              
//        [3,4],              [3, 4],            [2],
//       [6,5,7],      ==>   [7, 6, 10]     ==>  [9, 10]   ==>     [11]
//      [4,1,8,3]
//    ]
 
/**思路:
    * 自底向上 dp: 不需要额外的空间
    * dp[i][j] = min(dp[i+1][j], dp[i+1][j+1]) + triangle[i][j]
    * dp[i][j]: 表示到达 (i, j)最小路径的总和
*/
class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        int n = triangle.size();
        for(int i = n - 2; i >= 0; i--) {
            for(int j = 0; j <= i; j++) {
                triangle[i][j] += min(triangle[i+1][j], triangle[i+1][j+1]);   
            }
        }
        return triangle[0][0];
    }
};

Solution 2（dfs深度搜索）

class Solution {
    int minSum=INT_MAX;
public:
    void dfs(vector<vector<int> > &triangle,int row,int pos,int path)
    {
        path=path+triangle[row][pos];
        if(row==triangle.size()-1)
        {
            minSum=min(minSum,path);
            return ;
        }
        dfs(triangle,row+1,pos,path);
        dfs(triangle,row+1,pos+1,path);
        return ;
    }
    int minimumTotal(vector<vector<int> > &triangle) {
        dfs(triangle,0,0,0);
        return minSum;
    }

};