Package g0001_0100.s0064_minimum_path_sum

Class Solution

java.lang.Object

g0001_0100.s0064_minimum_path_sum.Solution

public class Solution
extends Object

64 - Minimum Path Sum.<p>Medium</p> <p>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.</p> <p><strong>Note:</strong> You can only move either down or right at any point in time.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/11/05/minpath.jpg" alt="" /></p> <p><strong>Input:</strong> grid = [[1,3,1],[1,5,1],[4,2,1]]</p> <p><strong>Output:</strong> 7</p> <p><strong>Explanation:</strong> Because the path 1 \u2192 3 \u2192 1 \u2192 1 \u2192 1 minimizes the sum.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> grid = [[1,2,3],[4,5,6]]</p> <p><strong>Output:</strong> 12</p> <p><strong>Constraints:</strong></p> <ul> <li><code>m == grid.length</code></li> <li><code>n == grid[i].length</code></li> <li><code>1 <= m, n <= 200</code></li> <li><code>0 <= grid[i][j] <= 100</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	minPathSum(int[][] grid)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minPathSum

public int minPathSum(int[][] grid)