LeetcodePractice/1222_queensAttacktheKing.py at main · shreshtashetty/LeetcodePractice · 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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
# 1222. Queens That Can Attack the King

class Solution:
    def queensAttacktheKing(self, queens: List[List[int]], king: List[int]) -> List[List[int]]:

        i = king[0]
        j = king[1]

        res = []

        while i<8:
            if [i,j] in queens:
                res.append([i,j])
                break
            i+=1
        i = king[0]


        while i>=0:
            if [i,j] in queens:
                res.append([i,j])
                break
            i-=1
        i = king[0]

        while j<8:
            if [i,j] in queens:
                res.append([i,j])
                break
            j+=1
        j = king[1]


        while j>=0:
            if [i,j] in queens:
                res.append([i,j])
                break
            j-=1
        j = king[1]

        while i<8 and j<8:
            if [i,j] in queens:
                res.append([i,j])
                break
            i+=1
            j+=1

        i = king[0]
        j = king[1]

        while i>=0 and j>=0:
            if [i,j] in queens:
                res.append([i,j])
                break
            i-=1
            j-=1

        i = king[0]
        j = king[1]

        while i>=0 and j<8:
            if [i,j] in queens:
                res.append([i,j])
                break
            i-=1
            j+=1

        i = king[0]
        j = king[1]

        while i<8 and j>=0:
            if [i,j] in queens:
                res.append([i,j])
                break
            i+=1
            j-=1

        i = king[0]
        j = king[1]

        return res