标签:
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).
设置数组m为最后一行,然后由下至上,转移方程 m[j] = t[i][j] + min(m[j],m[j+1])
var minimumTotal = function(t) { var m = t[t.length - 1] for (var i=t.length-2;i>=0;i--) for(var j=0;j<=i;j++) m[j] = t[i][j] + Math.min(m[j],m[j+1]) return m[0] }
标签:
原文地址:http://www.cnblogs.com/lilixu/p/4591520.html