coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01: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/[no content]design-tic-tac-toe.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 1597,
"likes": 1599,
"dislikes": 92,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Valid Tic-Tac-Toe State\", \"titleSlug\": \"valid-tic-tac-toe-state\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"176.3K\", \"totalSubmission\": \"308.4K\", \"totalAcceptedRaw\": 176284, \"totalSubmissionRaw\": 308429, \"acRate\": \"57.2%\"}",
"stats": "{\"totalAccepted\": \"176.6K\", \"totalSubmission\": \"308.9K\", \"totalAcceptedRaw\": 176589, \"totalSubmissionRaw\": 308913, \"acRate\": \"57.2%\"}",
"hints": [
"Could you trade extra space such that <code>move()</code> operation can be done in O(1)?",
"You need two arrays: int rows[n], int cols[n], plus two variables: diagonal, anti_diagonal."