minimum-path-sum

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

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

&#32473;&#23450;&#19968;&#20010;&#21253;&#21547;&#38750;&#36127;&#25972;&#25968;&#30340; <code>m&nbsp;x&nbsp;n</code>&nbsp;&#32593;&#26684;&nbsp;<code>grid</code> &#65292;&#35831;&#25214;&#20986;&#19968;&#26465;&#20174;&#24038;&#19978;&#35282;&#21040;&#21491;&#19979;&#35282;&#30340;&#36335;&#24452;&#65292;&#20351;&#24471;&#36335;&#24452;&#19978;&#30340;&#25968;&#23383;&#24635;&#21644;&#20026;&#26368;&#23567;&#12290;

&#35828;&#26126;&#65306;&#27599;&#27425;&#21482;&#33021;&#21521;&#19979;&#25110;&#32773;&#21521;&#21491;&#31227;&#21160;&#19968;&#27493;&#12290;

&nbsp;

&#31034;&#20363; 1&#65306;
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/05/minpath.jpg" style="width: 242px; height: 242px;" />
<pre>
&#36755;&#20837;&#65306;grid = [[1,3,1],[1,5,1],[4,2,1]]
&#36755;&#20986;&#65306;7
&#35299;&#37322;&#65306;&#22240;&#20026;&#36335;&#24452; 1&rarr;3&rarr;1&rarr;1&rarr;1 &#30340;&#24635;&#21644;&#26368;&#23567;&#12290;
</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;grid = [[1,2,3],[4,5,6]]
&#36755;&#20986;&#65306;12
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<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>

Sunbelt Computer Software

PL/B Language Development and Support