coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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/find-winner-on-a-tic-tac-toe-game.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 809,
"likes": 811,
"dislikes": 210,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"69.8K\", \"totalSubmission\": \"127.1K\", \"totalAcceptedRaw\": 69808, \"totalSubmissionRaw\": 127080, \"acRate\": \"54.9%\"}",
"stats": "{\"totalAccepted\": \"70.1K\", \"totalSubmission\": \"127.7K\", \"totalAcceptedRaw\": 70134, \"totalSubmissionRaw\": 127666, \"acRate\": \"54.9%\"}",
"hints": [
"It's straightforward to check if A or B won or not, check for each row/column/diag if all the three are the same.",
"Then if no one wins, the game is a draw iff the board is full, i.e. moves.length = 9 otherwise is pending."