[leetcode]64. Minimum Path Sum(Java)
来源:互联网 发布:xtbl勒索病毒变种java 编辑:程序博客网 时间:2024/06/05 15:06
https://leetcode.com/problems/minimum-path-sum/#/description
Given a m x n grid 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.
package go.jacob.day628;public class Demo2 {/* * 除去第一行第一列,每一格的最短路径为左一格最短路径加上当前值,或者上一格最短路径加上当前值 * Runtime: 3 ms.Your runtime beats 86.66 % of java submissions */public int minPathSum(int[][] grid) {if (grid == null || grid.length == 0 || grid[0].length == 0)return 0;int m = grid.length;int n = grid[0].length;for (int i = 1; i < m; i++) {grid[i][0] = grid[i - 1][0] + grid[i][0];}for (int i = 1; i < n; i++) {grid[0][i] = grid[0][i] + grid[0][i - 1];}for (int i = 1; i < m; i++) {for (int j = 1; j < n; j++) {grid[i][j] = (grid[i - 1][j] < grid[i][j - 1] ? grid[i - 1][j] : grid[i][j - 1]) + grid[i][j];}}return grid[m - 1][n - 1];}}
阅读全文
0 0
- (Java)LeetCode-64. Minimum Path Sum
- Leetcode 64. Minimum Path Sum (Medium) (java)
- 【leetcode】64. Minimum Path Sum【java】
- leetcode oj java 64. Minimum Path Sum
- [leetcode]64. Minimum Path Sum(Java)
- [Leetcode] Minimum Path Sum (Java)
- [LeetCode][Java] Minimum Path Sum
- [LeetCode][Java] Minimum Path Sum
- [LeetCode]64.Minimum Path Sum
- LeetCode --- 64. Minimum Path Sum
- LeetCode 64.Minimum Path Sum
- [Leetcode] 64. Minimum Path Sum
- [leetcode] 64.Minimum Path Sum
- [leetcode] 64.Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- 64. Minimum Path Sum LeetCode
- [LeetCode]64. Minimum Path Sum
- leetcode 64. Minimum Path Sum
- Linux下远程连接MySQL数据库
- 《Java编程思想》学习笔记8——Java new I/O(一)
- 各种协议分析备忘
- IDA调试so文件基础篇
- Kotlin 中的 类 和 继承 (二)
- [leetcode]64. Minimum Path Sum(Java)
- 外部资源编码设置
- VS2015允许局域网远程调试网站
- 谈谈 iOS 中图片的解压缩
- 操作系统课程设计-二级文件系统,Linux平台版本,c语言
- 机器人运动范围--《剑指offer》
- java-多态
- EglSwapBuffers exception on Android (EGL_BAD_CONTEXT )
- 游戏功能及产品的特点