leetcode Triangle

题目连接

https://leetcode.com/problems/triangle/  

Triangle

Description

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 is 11 (i.e., 2 + 3 + 5 + 1 = 11).

class Solution {
public:
	int minimumTotal(vector<vector<int>>& triangle) {
		if (triangle.empty() || triangle[0].empty()) return 0;
		n = triangle.size();
		arr = triangle;
		dp.resize(n, vector<int>(n));
		return dfs(0, 0);
	}
private:
	int n;
	vector<vector<int>> dp;
	vector<vector<int>> arr;
	int dfs(int i, int j) {
		int ret;
		if (i >= n || j >= n) return 0;
		if (dp[i][j]) return dp[i][j];
		if (i == n - 1) ret = 0;
		ret = arr[i][j] + min(dfs(i + 1, j), dfs(i + 1, j + 1));
		return dp[i][j] = ret;
	}
};

 

转载于:https://www.cnblogs.com/GadyPu/p/5034104.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值