LeetCode 64
来源:互联网 发布:自动化软件开发工程师 编辑:程序博客网 时间:2024/06/10 12:36
原题:
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.
题意:和前两题类似,选取路径最短的那一条
代码和思路:
class Solution { public int minPathSum(int[][] grid) { int m = grid.length; int n = grid[0].length; for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ //处理第一行 if(i==0 && j !=0){ grid[i][j] += grid[i][j-1]; } //处理第一列 else if(j==0 && i!=0){ grid[i][j] += grid[i-1][j]; } //起始点 else if(i==0 && j==0){ grid[i][j] = grid[i][j]; } //因为路径可以从 左 和 上 过来。所以选取最小的那一条 else{ grid[i][j] += Math.min(grid[i-1][j],grid[i][j-1]); } } } return grid[m-1][n-1]; }}
阅读全文
0 0
- leetcode 64
- LeetCode.64
- LeetCode 64
- leetcode 64
- LeetCode(64)- Min Stack
- leetcode #64 in cpp
- leetCode练习(64)
- leetcode 64&70
- [Leetcode] 85, 64, 123
- LeetCode Weekly Contest 64
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- 【Algorithm】Keyboards
- leetcode 695. Max Area of Island(未解决)
- ajax的执行流程
- Redis 集群安装详细步骤
- spring-shiro实现角色(roles)自定义Filter----配置多个角色的或关系
- LeetCode 64
- char 判断字符是否为大小写
- HTTPOXY漏洞说明
- H264 NAL_AUD
- mybatis源码解析
- 排序算法
- 练习 8:更多的重定向和过滤:head,tail,awk,grep,sed
- 基于PHP+redis的秒杀系统
- 关于网络协议的一点学习