LeetCode[85]::Maximal Rectangle C++

最新推荐文章于 2019-11-02 14:50:49 发布

iouiwc

最新推荐文章于 2019-11-02 14:50:49 发布

阅读量621

点赞数

分类专栏： C++ LeetCode

本文链接：https://blog.csdn.net/u013300875/article/details/47863377

版权

C++ 同时被 2 个专栏收录

19 篇文章 0 订阅

订阅专栏

LeetCode

9 篇文章 0 订阅

订阅专栏

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

class Solution {
public:
    int maximalRectangle(vector<vector<char>>& matrix) {
        int m = matrix.size();
        if(m == 0){
            return 0;
        }

        int n = matrix[0].size();
        if(n == 0){
            return 0;
        }

        vector<int> count(n, 0);
        vector<bool> isProcessed(n, false);

        int area = 0;

        for(size_t i = 0; i < m; ++i){
            for(size_t j = 0; j < n; ++j){
                if(matrix[i][j] == '0'){
                    count[j] = 0;
                    isProcessed[j] = true;
                }else{
                    count[j]++;
                    isProcessed[j] = false;
                }
            }

            for(size_t j = 0; j < n; ++j){
                if(isProcessed[j]){
                    continue;
                }
                int biasLeft = 1;
                int biasRight = 1;
                while( (j-biasLeft >= 0) && (count[j-biasLeft] >= count[j]) ){
                    if(count[j-biasLeft] == count[j]){
                        isProcessed[j-biasLeft] = true;
                    }
                    biasLeft++;
                }
                while( (j+biasRight < n) && (count[j+biasRight] >= count[j]) ){

                    biasRight++;
                }

                area = max(area, (biasRight + biasLeft - 1)*count[j]);
            }
        }
        return area;
    }
};