[数据结构与算法]leetcode:网格照明

思路：
被骗了，这道题其实不难
就是哈希表+set
需要区分主灯和傀儡灯的概念即可

src：

class Solution:
    def gridIllumination(self, n: int, lamps: List[List[int]], queries: List[List[int]]) -> List[int]:
        # 主灯
        points = set()
        # 傀儡灯
        # 注意两个对角的写法
        row, col, diagonal, antiDiagonal = Counter(), Counter(), Counter(), Counter()
        for r, c in lamps:
            if (r, c) in points:
                continue
            points.add((r, c))
            row[r] += 1
            col[c] += 1
            # 两个傀儡对角的规律
            diagonal[r - c] += 1
            antiDiagonal[r + c] += 1

        ans = [0] * len(queries)
        for i, (r, c) in enumerate(queries):
            # 但凡有傀儡
            if row[r] or col[c] or diagonal[r - c] or antiDiagonal[r + c]:
                ans[i] = 1
            for x in range(r - 1, r + 2):
                for y in range(c - 1, c + 2):
                    # 只熄灭主灯
                    if x < 0 or y < 0 or x >= n or y >= n or (x, y) not in points:
                        continue
                    # 主灯的连带效果
                    points.remove((x, y))
                    row[x] -= 1
                    col[y] -= 1
                    diagonal[x - y] -= 1
                    antiDiagonal[x + y] -= 1
        return ans

总结：
counter的使用，找到两个对角的规律，被hard骗了