1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 4341,
"dislikes": 216,
"likes": 4349,
"dislikes": 217,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Shortest Path to Get Food\", \"titleSlug\": \"shortest-path-to-get-food\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Operations to Remove Adjacent Ones in Matrix\", \"titleSlug\": \"minimum-operations-to-remove-adjacent-ones-in-matrix\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[[0,0,0],[0,1,0],[0,0,0]]\n[[0,0,0],[0,1,0],[1,1,1]]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"226.9K\", \"totalSubmission\": \"519.3K\", \"totalAcceptedRaw\": 226883, \"totalSubmissionRaw\": 519339, \"acRate\": \"43.7%\"}",
"stats": "{\"totalAccepted\": \"227.6K\", \"totalSubmission\": \"520.7K\", \"totalAcceptedRaw\": 227562, \"totalSubmissionRaw\": 520659, \"acRate\": \"43.7%\"}",
"hints": [],
"solution": {
"id": "113",