[Python 3/Java] check 8 directions, with explanation and analys.
Start from king, for each direction in the 8 ones, move 1 step each time till find a queen or out of bound.\n\n\n\nTime and Space Complexity\n~~~O(64)~~~\nTime:
Start from king, for each direction in the 8 ones, move 1 step each time till find a queen or out of bound.\n<iframe src="https://leetcode.com/playground/Ydxfqc7c/shared" frameBorder="0" width="800" height="400"></iframe>\n\n\n**Time and Space Complexity**\n~~~O(64)~~~\nTime: `O(n * n + Q)`, space: `O(Q)`, where `n = 8` is the size of the chess board, and `Q = queen.length` is the size of the `queen`.
['Java', 'Python3']