<!DOCTYPE html>
<html>
<body>
<p>最小路径是：</p>
<p id="yyy"></p>
<script>
var themin=0;
var grid = [
[1,3,1],
[1,5,1],
[4,2,1] ]
function minPathSum(grid) {
var i,k,j;
var sum = new Array(9);
for (var i=0; i<3; i++) {
sum[i] = new Array(3);
}
sum[0][0]=grid[0][0];
for (k=0; k<3; k++) {
for (j=0; j<3; j++) {
if ((k===0)&&(j===0)) {
sum[0][0]=grid[0][0];
}else if(k-1<0) {
sum[k][j] = sum[k][j-1]+grid[k][j];
} else if(j-1<0) {
sum[k][j] = sum[k-1][j]+grid[k][j];
}else {
sum[i][j] =Math.min(sum[k-1][j], sum[k][j-1])+grid[k][j];
}
}
}
return sum[2][2];
}
var x = minPathSum(grid);
var p=document.getElementById("yyy");
p.innerHTML = x;
</script>
</body>
</html>
