Python | Leetcode Python题解之第554题砖墙
题目: 题解: class Solution:def leastBricks(self, wall: List[List[int]]) -> int:n len(wall)# heap内存放的格式为(前缀和、行、列)heap list()ans nfor i in range(n):if len(wall[i]) > 1:heapq.heappush(heap, [wall[i][0], i, 1])whil…
2025-09-18