leetcode/1222.py at master · dibery/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
class Solution:
    def queensAttacktheKing(self, queens: List[List[int]], king: List[int]) -> List[List[int]]:
        ans = []
        for i in range(king[0] - 1, -1, -1):
            if [i, king[1]] in queens:
                ans.append([i, king[1]])
                print([i, king[1]])
                break
        for i in range(king[0] + 1, 8):
            if [i, king[1]] in queens:
                ans.append([i, king[1]])
                print([i, king[1]])
                break
        for i in range(king[1] - 1, -1, -1):
            if [king[0], i] in queens:
                ans.append([king[0], i])
                print([king[0], i])
                break
        for i in range(king[1] + 1, 8):
            if [king[0], i] in queens:
                ans.append([king[0], i])
                print([king[0], i])
                break
        for i in range(1, 8):
            if max(king) + i >= 8:
                break
            if [king[0] + i, king[1] + i] in queens:
                ans.append([king[0] + i, king[1] + i])
                break
        for i in range(1, 8):
            if min(king) - i < 0:
                break
            if [king[0] - i, king[1] - i] in queens:
                ans.append([king[0] - i, king[1] - i])
                break
        for i in range(8):
            if king[0] + i >= 8 or king[1] - i < 0:
                break
            if [king[0] + i, king[1] - i] in queens:
                ans.append([king[0] + i, king[1] - i])
                break
        for i in range(8):
            if king[1] + i >= 8 or king[0] - i < 0:
                break
            if [king[0] - i, king[1] + i] in queens:
                ans.append([king[0] - i, king[1] + i])
                break
        return ans