87,993
社区成员
发帖
与我相关
我的任务
分享为什么这段保存成HTML之后没有结果呢？？？？？？？在测试页上也不成功（要求从左上到右下的最小距离）
<!DOCTYPE html>
<html>
<body>
<p>最小路径是：</p>
<p id="yyy"></p>
<script>
var themin=0;
var grid = [
[0,5,0,6,0,7,0,8,0],
[3,0,1,0,3,0,1,0,3],
[0,1,0,2,0,3,0,4,0],
[2,0,2,0,2,0,2,0,2],
[0,5,0,6,0,7,0,8,0],
[1,0,3,0,1,0,3,0,1],
[0,4,0,3,0,2,0,1,0] ]
function minPathSum(grid) {
var i,k,j;
var sum = new Array(63);
for (var i=0; i<7; i++) {
sum[i] = new Array(0,0,0,0,0,0,0,0,0);
}
sum[0][0]=grid[0][0];
for (k=0; k<7; k+=2) {
for (j=0; j<9; j+=2) {
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-2];
} else if(j-1<0) {
sum[k][j] = sum[k-1][j]+grid[k-2][j];
}else {
sum[i][j] =Math.min(sum[k-2][j]+sum[k-1][j], sum[k][j-2]+sum[k][j-1]);
}
}
}
return sum[7][9];
}
var x = minPathSum(grid);
var p=document.getElementById("yyy");
p.innerHTML = x;
</script>
</body>
</html>
<html>
<body>
<p>最小路径是：</p>
<p id="yyy"></p>
<script>
var themin=0;
var grid = [
[0,5,0,6,0,7,0,8,0],
[3,0,1,0,3,0,1,0,3],
[0,1,0,2,0,3,0,4,0],
[2,0,2,0,2,0,2,0,2],
[0,5,0,6,0,7,0,8,0],
[1,0,3,0,1,0,3,0,1],
[0,4,0,3,0,2,0,1,0] ]
function minPathSum(grid) {
var i,k,j;
var sum = new Array(63);
for (var i=0; i<7; i++) {
sum[i] = new Array(0,0,0,0,0,0,0,0,0);
}
sum[0][0]=grid[0][0];
for (k=0; k<7; k+=2) {
for (j=0; j<9; j+=2) {
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-2];
} else if(j-1<0) {
sum[k][j] = sum[k-1][j]+grid[k-2][j];
}else {
sum[i][j] =Math.min(sum[k-2][j]+sum[k-1][j], sum[k][j-2]+sum[k][j-1]);
}
}
}
return sum[7][9];
}
var x = minPathSum(grid);
var p=document.getElementById("yyy");
p.innerHTML = x;
</script>
</body>
</html>
...全文
请发表友善的回复…
发表回复
zsbrittany 2020-11-22
- 打赏
- 举报
原题是求这个方格从左下到右上的最小距离
