minimum-path-sum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a <code>m x n</code> <code>grid</code> filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/05/minpath.jpg" style="width: 242px; height: 242px;" />
<pre>
Input: grid = [[1,3,1],[1,5,1],[4,2,1]]
Output: 7
Explanation: Because the path 1 &rarr; 3 &rarr; 1 &rarr; 1 &rarr; 1 minimizes the sum.
</pre>

Example 2:

<pre>
Input: grid = [[1,2,3],[4,5,6]]
Output: 12
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>m == grid.length</code></li>
	<li><code>n == grid[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 200</code></li>
	<li><code>0 &lt;= grid[i][j] &lt;= 200</code></li>
</ul>

minPathSum

Minimum Path Sum

Unique Paths

unique-paths

不同路径

Dungeon Game

dungeon-game

地下城游戏

Cherry Pickup

cherry-pickup

摘樱桃

Minimum Path Cost in a Grid

minimum-path-cost-in-a-grid

网格中的最小路径代价

Maximum Number of Points with Cost

maximum-number-of-points-with-cost

扣分后的最大得分

Minimum Cost Homecoming of a Robot in a Grid

minimum-cost-homecoming-of-a-robot-in-a-grid

网格图中机器人回家的最小代价

Paths in Matrix Whose Sum Is Divisible by K

paths-in-matrix-whose-sum-is-divisible-by-k

矩阵中和能被 K 整除的路径

Check if There is a Path With Equal Number of 0's And 1's

check-if-there-is-a-path-with-equal-number-of-0s-and-1s

检查是否有路径经过相同数量的 0 和 1

Minimum Cost of a Path With Special Roads

minimum-cost-of-a-path-with-special-roads

前往目标的最小代价

Array

Dynamic Programming

Matrix

给定一个包含非负整数的 <code>m&nbsp;x&nbsp;n</code>&nbsp;网格&nbsp;<code>grid</code> ，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。

说明：每次只能向下或者向右移动一步。

&nbsp;

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/05/minpath.jpg" style="width: 242px; height: 242px;" />
<pre>
输入：grid = [[1,3,1],[1,5,1],[4,2,1]]
输出：7
解释：因为路径 1→3→1→1→1 的总和最小。
</pre>

示例 2：

<pre>
输入：grid = [[1,2,3],[4,5,6]]
输出：12
</pre>

&nbsp;

提示：

<ul>
	<li><code>m == grid.length</code></li>
	<li><code>n == grid[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 200</code></li>
	<li><code>0 &lt;= grid[i][j] &lt;= 200</code></li>
</ul>