Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Leetcode 999 Available Captures for Rook(车的可用捕获量) | Leo Yang's Blog #36

Open
leo-yang0201 opened this issue Mar 27, 2020 · 0 comments
Open

Leetcode 999 Available Captures for Rook(车的可用捕获量) | Leo Yang's Blog #36

leo-yang0201 opened this issue Mar 27, 2020 · 0 comments
Labels
26baf7e8cd7882e7777a95eb981b15c8 Gitalk

Comments

@leo-yang0201
Copy link
Owner

https://leo-yang0201.github.io/leo-yang0201.github.io/2020/03/26/Leetcode-999-Available-Captures-for-Rook/

Difficulty : Easy Type: Array Language : Java ClarificationOn an 8 x 8 chessboard, there is one white rook. There also may be empty squares, white bishops, and black pawns. These are given as characte
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
26baf7e8cd7882e7777a95eb981b15c8 Gitalk
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@leo-yang0201