mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 4349,
|
||||
"dislikes": 217,
|
||||
"likes": 4483,
|
||||
"dislikes": 222,
|
||||
"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\": \"227.6K\", \"totalSubmission\": \"520.7K\", \"totalAcceptedRaw\": 227562, \"totalSubmissionRaw\": 520659, \"acRate\": \"43.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"236.4K\", \"totalSubmission\": \"539.9K\", \"totalAcceptedRaw\": 236369, \"totalSubmissionRaw\": 539899, \"acRate\": \"43.8%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "113",
|
||||
|
Reference in New Issue
Block a user