Package g1201_1300.s1222_queens_that_can_attack_the_king

Class Solution

java.lang.Object

g1201_1300.s1222_queens_that_can_attack_the_king.Solution

public class Solution
extends Object

1222 - Queens That Can Attack the King.<p>Medium</p> <p>On an <strong>8x8</strong> chessboard, there can be multiple Black Queens and one White King.</p> <p>Given an array of integer coordinates <code>queens</code> that represents the positions of the Black Queens, and a pair of coordinates <code>king</code> that represent the position of the White King, return the coordinates of all the queens (in any order) that can attack the King.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2019/10/01/untitled-diagram.jpg" alt="" /></p> <p><strong>Input:</strong> queens = [[0,1],[1,0],[4,0],[0,4],[3,3],[2,4]], king = [0,0]</p> <p><strong>Output:</strong> [[0,1],[1,0],[3,3]]</p> <p><strong>Explanation:</strong></p> <p>The queen at [0,1] can attack the king cause they&rsquo;re in the same row.</p> <p>The queen at [1,0] can attack the king cause they&rsquo;re in the same column.</p> <p>The queen at [3,3] can attack the king cause they&rsquo;re in the same diagnal.</p> <p>The queen at [0,4] can&rsquo;t attack the king cause it&rsquo;s blocked by the queen at [0,1].</p> <p>The queen at [4,0] can&rsquo;t attack the king cause it&rsquo;s blocked by the queen at [1,0].</p> <p>The queen at [2,4] can&rsquo;t attack the king cause it&rsquo;s not in the same row/column/diagnal as the king.</p> <p><strong>Example 2:</strong></p> <p><strong><img src="https://assets.leetcode.com/uploads/2019/10/01/untitled-diagram-1.jpg" alt="" /></strong></p> <p><strong>Input:</strong> queens = [[0,0],[1,1],[2,2],[3,4],[3,5],[4,4],[4,5]], king = [3,3]</p> <p><strong>Output:</strong> [[2,2],[3,4],[4,4]]</p> <p><strong>Example 3:</strong></p> <p><strong><img src="https://assets.leetcode.com/uploads/2019/10/01/untitled-diagram-2.jpg" alt="" /></strong></p> <p><strong>Input:</strong> queens = [[5,6],[7,7],[2,1],[0,7],[1,6],[5,1],[3,7],[0,3],[4,0],[1,2],[6,3],[5,0],[0,4],[2,2],[1,1],[6,4],[5,4],[0,0],[2,6],[4,5],[5,2],[1,4],[7,5],[2,3],[0,5],[4,2],[1,0],[2,7],[0,1],[4,6],[6,1],[0,6],[4,3],[1,7]], king = [3,4]</p> <p><strong>Output:</strong> [[2,3],[1,4],[1,6],[3,7],[4,3],[5,4],[4,5]]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= queens.length <= 63</code></li> <li><code>queens[i].length == 2</code></li> <li><code>0 <= queens[i][j] < 8</code></li> <li><code>king.length == 2</code></li> <li><code>0 <= king[0], king[1] < 8</code></li> <li>At most one piece is allowed in a cell.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
void	dfs(Map<Integer,Set<Integer>> queens, int x, int y, List<List<Integer>> result, String direction)
List<List<Integer>>	queensAttacktheKing(int[][] queens, int[] king)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

queensAttacktheKing

public List<List<Integer>> queensAttacktheKing(int[][] queens,
 int[] king)

dfs

public void dfs(Map<Integer,Set<Integer>> queens,
 int x,
 int y,
 List<List<Integer>> result,
 String direction)