목록302. Smallest Rectangle Enclosing Black Pixels (1)

Scribbling

LeetCode: 302. Smallest Rectangle Enclosing Black Pixels

Perhaps, the most thinkable solution would be DFS or BFS. Traverse all the '1' points and update mins and maxs. Time complexity would be O(M*N) in this case. class Solution: def minArea(self, image: List[List[str]], x: int, y: int) -> int: m, n = len(image), len(image[0]) ymin, ymax, xmin, xmax = m, -1, n, -1 dy, dx = [0, 1, 0, -1], [1, 0, -1, 0] stack, visited = [(x, y)], set() while stack: i, ..
Computer Science/Coding Test 2022. 1. 25. 13:47
이전 Prev 1 Next 다음