LeetCode 动态规划入门 Day16 Java

64. 最小路径和

问题描述:

 代码:

class Solution {
    public int minPathSum(int[][] grid) {
        int [][]f=new int[grid.length][grid[0].length];
        f[0][0]=grid[0][0];
        for(int i=0;i 
思路:
 
动态规划
 
221. 最大正方形
 
问题描述:
 
 
 代码:
 
class Solution {
    public int maximalSquare(char[][] matrix) {
       int n=matrix.length;
       int m=matrix[0].length;
       int [][]f=new int[n][m];
       int maxS=0;
       f[0][0]=1;
        for(int i=0;i 
思路:
 
 
 
 
力扣https://leetcode-cn.com/problems/maximal-square/solution/zui-da-zheng-fang-xing-by-leetcode-solution/