[leetcode] 1139. Largest 1-Bordered Square

最新推荐文章于 2023-02-17 21:16:55 发布

农民小飞侠

最新推荐文章于 2023-02-17 21:16:55 发布

阅读量166

点赞数

分类专栏： python leetcode题解

本文链接：https://blog.csdn.net/w5688414/article/details/109824170

版权

leetcode题解同时被 2 个专栏收录

903 篇文章 5 订阅

订阅专栏

python

556 篇文章 2 订阅

订阅专栏

Description

Given a 2D grid of 0s and 1s, return the number of elements in the largest square subgrid that has all 1s on its border, or 0 if such a subgrid doesn’t exist in the grid.

Example 1:

Input: grid = [[1,1,1],[1,0,1],[1,1,1]]
Output: 9

Example 2:

Input: grid = [[1,1,0,0]]
Output: 1

Constraints:

1 <= grid.length <= 100
1 <= grid[0].length <= 100
grid[i][j] is 0 or 1

分析

题目的意思是：给定一个包含01的网格，求出1所能构造出的最大正方形，边界为1就行了。这道题我做不出来，我分享一下别人的思路，首先top数组记录的是列的1的个数，left记录的是行的连续为1的个数。然后r表示边长，从大变小，找到第一个满足r条件的正方形就是最大的正方形了。接下来就是找满足r的正方形，需要根据top和left数组求出来。
例如

Input: grid = [[1,1,1],[1,0,1],[1,1,1]]
left=[[1, 2, 3], [1, 0, 1], [1, 2, 3]]
top=[[1, 1, 1], [2, 0, 2], [3, 1, 3]]
9
left[0][2] left[2][2] 行最大
top[2][0] top[2][2] 列最大

代码

class Solution:
    def largest1BorderedSquare(self, grid: List[List[int]]) -> int:
        m=len(grid)
        n=len(grid[0])
        top=[a[:] for a in grid]
        left=[a[:] for a in grid]
        for i in range(m):
            for j in range(n):
                if(grid[i][j]):
                    if(i):
                        top[i][j]=top[i-1][j]+1
                    if(j):
                        left[i][j]=left[i][j-1]+1
        for r in range(min(m,n),0,-1):
            for i in range(m-r+1):
                for j in range(n-r+1):
                    k=min(top[i+r-1][j],top[i+r-1][j+r-1])
                    k=min(k,left[i][j+r-1],left[i+r-1][j+r-1])
                    if(k>=r):
                        return r*r
        return 0

代码二

class Solution:
    def largest1BorderedSquare(self, grid):
        m=len(grid)
        n=len(grid[0])
        top=[a[:] for a in grid]
        left=[a[:] for a in grid]
        for i in range(m):
            for j in range(n):
                if(grid[i][j]):
                    if(i):
                        top[i][j]=top[i-1][j]+1
                    if(j):
                        left[i][j]=left[i][j-1]+1
        print(left)
        print(top)
        for r in range(min(m,n),0,-1):
            for i in range(m-r+1):
                for j in range(n-r+1):
                    k=min(top[i+r-1][j],top[i+r-1][j+r-1])
                    k=min(k,left[i][j+r-1],left[i+r-1][j+r-1])
                    if(k>=r):
                        return r*r
        return 0

if __name__ == "__main__":
    grid = [[1,1,1],[1,0,1],[1,1,1]]
    solution=Solution()
    res=solution.largest1BorderedSquare(grid)
    print(res)