[Leetcode]Maximal Square

最新推荐文章于 2020-05-21 10:58:36 发布

dyllanzhou

最新推荐文章于 2020-05-21 10:58:36 发布

阅读量274

点赞数

分类专栏： algorithm 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/dyllanzhou/article/details/47958861

版权

algorithm 专栏收录该内容

96 篇文章 0 订阅

订阅专栏

Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.

For example, given the following matrix:

Return 4.

class Solution {
public:
    /*algorithm: brute force
      1)scan from row 0 - n - 1
        check each square ,book the len of square
      time O((m*n)^2) space O(1)
      we can optimize the scan method to reduce the search space
    */
    int square(vector<vector<char>>& matrix,int x,int y){
        int m = matrix.size(),n = matrix[0].size();
        int l;
        for(l=1;l <= min(m,n);l++){
            if((x+l)> m || (y+l) > n)break;
            for(int i = 0;i < l;i++)
                for(int j = 0;j < l;j++){
                if(matrix[x+i][y+j]=='0')
                    return l-1;
            }
        }
        return l-1;
    }
    int maximalSquare(vector<vector<char>>& matrix) {
        int m = matrix.size();
        if(m < 1)return 0;
        int n = matrix[0].size();
        if(n < 1)return 0;
        int maxLen = 0;
        int minLen = min(m,n);
        for(int r = 0;r < m;r++)
         for(int c = 0; c < n;c++){
           int len = square(matrix,r,c);
           if(len > maxLen)maxLen = len;
           if(maxLen >= minLen)break;
           if((c+maxLen) >= n)break;
        }
        return maxLen*maxLen;
    }
};

    /*algorithm: dp solution
        dp(i,j) = min{dp(i,j-1),dp(i-1,j),dp(i-1,j-1)} + 1, if(m[i][j] == 1)
        dp(i,j) = 0, if(m[i][j]=0)
        time O(m*n) space O(m*n)
        1 0 1 0 0
        1 0 1 1 1
        1 1 1 1 1
        1 0 0 1 0
        
        1 0 1 0 0
        1 0 1 1 1
        1 1 1 2 2
        1 0 0 1 0        
    */
    int maximalSquare(vector<vector<char>>& matrix) {
        int m = matrix.size();
        if(m < 1)return 0;
        int n = matrix[0].size();
        vector<vector<int> >dp(m+1,vector<int>(n+1,0));
        int maxLen = 0;
        for(int i = 1;i <= m;i++)
         for(int j = 1;j <= n;j++){
             if(matrix[i-1][j-1]=='1')
             {
                 dp[i][j] = min(min(dp[i][j-1],dp[i-1][j-1]),dp[i-1][j]) + 1;
                 maxLen = max(dp[i][j],maxLen);
             }
         }
        
        return maxLen*maxLen;
    }
    /*algorithm: dp solution
        dp(i,j) = min{dp(i,j-1),dp(i-1,j),dp(i-1,j-1)} + 1, if(m[i][j] == 1)
        dp(i,j) = 0, if(m[i][j]=0)
        opmize the memory space to O(1),don't allocate extract space for dp
        time O(m*n) space O(1)
    */
    int maximalSquare(vector<vector<char>>& matrix) {
        int m = matrix.size();
        if(m < 1)return 0;
        int n = matrix[0].size();
        char maxLen = '0';
        for(int i = 0;i < m;i++)
         for(int j = 0;j < n;j++){
            if(matrix[i][j] == '1'){
                if(i > 0 && j > 0)
                   matrix[i][j] = min(min(matrix[i][j-1],matrix[i-1][j-1]),matrix[i-1][j]) + 1;
                maxLen = max(matrix[i][j],maxLen);
            }
         }
         maxLen -= '0';
        return maxLen*maxLen;
    }