1222.Can attack the queen of the king

topic：

topic链接

Thought：

直接simulation，Determine horizontal，Vertical，Whether the queen on the diagonal line exists，if it exists，Just record，Last return。

The answer method is similar to mine，But more concise，Go out of the king，The first queen that recording encountered。

Code：

I am

class Solution:
    def queensAttacktheKing(self, queens: List[List[int]], king: List[int]) -> List[List[int]]:
        x = king[0]
        y = king[1]
        x_left_diff = 64
        x_right_diff = 64
        left_high_diff = 64
        left_low_diff = 64
        right_high_diff = 64
        right_low_diff = 64
        y_left_diff = 64
        y_right_diff = 64
        res = [[]] * 8
        print(res)
        for i, j in queens:
            # Horizontal
            if i == x:
                if j < y and abs(j - y) < x_left_diff:
                    res[0] = [i, j]
                    x_left_diff = abs(j - y)
                elif j > y and abs(j - y) < x_right_diff:
                    res[1] = [i, j]
                    x_right_diff = abs(j - y)
            # Vertical
            elif j == y:
                if i < x and abs(i - x) < y_left_diff:
                    res[6] = [i, j]
                    y_left_diff = abs(i - x)
                elif i > x and abs(i - x) < y_right_diff:
                    res[7] = [i, j]
                    y_right_diff = abs(i - x)
            # Diagonal
            elif abs(i - x) == abs(j - y):
                if i < x and j < y and abs(i - x) < left_high_diff:
                    res[2] = [i, j]
                    left_high_diff = abs(i - x)
                elif i < x and j > y and abs(i - x) < left_low_diff:
                    res[3] = [i, j]
                    left_low_diff = abs(i - x)
                elif i > x and j < y and abs(i - x) < right_high_diff:
                    res[4] = [i, j]
                    right_high_diff = abs(i - x)
                elif i > x and j > y and abs(i - x) < right_low_diff:
                    res[5] = [i, j]
                    right_low_diff = abs(i - x)
        return [i for i in res if i != []]

Answer

class Solution:
    def queensAttacktheKing(self, queens: List[List[int]], king: List[int]) -> List[List[int]]:
        s = set(map(tuple, queens))
        ans = []
        for dx, dy in (1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1):
            x, y = king[0] + dx, king[1] + dy
            while 0 <= x < 8 and 0 <= y < 8:
                if (x, y) in s:
                    ans.append([x, y])
                    break
                x += dx
                y += dy
        return ans