求网格从左上到右下、每次只能右/下移、路径数字和最小（minPathSum），横线处应填入：
for (int i = 1; i < m; i++)
for (int j = 1; j < n; j++)
________; // 填入选项
return dp[m-1][n-1];
- A. dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + grid[i][1];
- B. dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
- C. dp[i][j] = min(dp[i-1][j], dp[i][j]) + grid[i][j];
- D. dp[i][j] = min(dp[i][j], dp[i][j-1]) + grid[i][j];
正确答案：B