coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/number-of-valid-move-combinations-on-chessboard.json
View File

@@ -12,7 +12,7 @@
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 30,
"dislikes": 158,
"dislikes": 161,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[\"rook\"]\n[[1,1]]\n[\"queen\"]\n[[1,1]]\n[\"bishop\"]\n[[4,3]]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"3.8K\", \"totalAcceptedRaw\": 2227, \"totalSubmissionRaw\": 3778, \"acRate\": \"58.9%\"}",
"stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"3.8K\", \"totalAcceptedRaw\": 2248, \"totalSubmissionRaw\": 3817, \"acRate\": \"58.9%\"}",
"hints": [
"N is small, we can generate all possible move combinations.",
"For each possible move combination, determine which ones are valid."