LeetCode动态规划专题：第十六天

Leetcode64. 最小路径和

思路：动态规划

class Solution {
public:
    int minPathSum(vector<vector<int>>& g) {
        int n = g.size(), m = g[0].size();
        for (int i = 0; i < n; i ++ )
            for (int j = 0; j < m; j ++ )
                if (!i && !j) continue;
                else {
                    if (i && j) g[i][j] += min(g[i - 1][j], g[i][j - 1]);
                    else if (i) g[i][j] += g[i - 1][j];
                    else g[i][j] += g[i][j - 1];
                }
        return g[n - 1][m - 1];
    }
};

Leetcode221. 最大正方形

思路：动态规划

递推公式：

f[i][j] = min(f[i - 1][j - 1], min(f[i - 1][j], f[i][j - 1])) + 1;

class Solution {
public:
    int maximalSquare(vector<vector<char>>& matrix) {
        int n = matrix.size(), m = matrix[0].size();
        vector<vector<int>> f(n + 1, vector<int>(m + 1));
        int res = 0;
        for (int i = 1; i <= n; i ++ )
            for (int j = 1; j <= m; j ++ )
                if (matrix[i - 1][j - 1] == '1') {
                    f[i][j] = min(f[i - 1][j - 1], min(f[i - 1][j], f[i][j - 1])) + 1;
                    res = max(res, f[i][j]);
                }
        return res * res;
    }
};