-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathquestion1222.js
101 lines (91 loc) · 2.01 KB
/
question1222.js
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
/**
* @name Queens That Can Attack the King
* @param {number[][]} queens
* @param {number[]} king
* @return {number[][]}
*/
let queensAttacktheKing = function(queens, king) {
let m = king[0],
n = king[1],
res = [],
map = {};
for (let i = 0; i < queens.length; i++) {
map[queens[i]] = i;
}
// [0, 1] !== [0, 1];
// Arrays are converted to strings implicitly when used as object keys.
while (n >= 0) {
if (map.hasOwnProperty([m, n - 1])) {
res.push([m, n - 1]);
break;
}
n--;
}
n = king[1];
while (m < 8) {
if (map.hasOwnProperty([m + 1, n])) {
res.push([m + 1, n]);
break;
}
m++;
}
m = king[0];
while (n < 8) {
if (map.hasOwnProperty([m, n + 1])) {
res.push([m, n + 1]);
break;
}
n++;
}
n = king[1];
while (m >= 0) {
if (map.hasOwnProperty([m - 1, n])) {
res.push([m - 1, n]);
break;
}
m--;
}
m = king[0];
while (m < 8 && n >= 0) {
if (map.hasOwnProperty([m + 1, n - 1])) {
res.push([m + 1, n - 1]);
break;
}
m++;
n--;
}
m = king[0];
n = king[1];
while (m < 8 && n < 8) {
if (map.hasOwnProperty([m + 1, n + 1])) {
res.push([m + 1, n + 1]);
break;
}
m++;
n++;
}
m = king[0];
n = king[1];
while (m >= 0 && n < 8) {
if (map.hasOwnProperty([m - 1, n + 1])) {
res.push([m - 1, n + 1]);
break;
}
m--;
n++;
}
m = king[0];
n = king[1];
while (m >= 0 && n >= 0) {
if (map.hasOwnProperty([m - 1, n - 1])) {
res.push([m - 1, n - 1]);
break;
}
m--;
n--;
}
m = king[0];
n = king[1];
return res;
};
queensAttacktheKing([[0, 1], [1, 0], [4, 0], [0, 4], [3, 3], [2, 4]], [0, 0]);