mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 2509,
|
||||
"dislikes": 119,
|
||||
"likes": 2516,
|
||||
"dislikes": 120,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Minimum Path Sum\", \"titleSlug\": \"minimum-path-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Dungeon Game\", \"titleSlug\": \"dungeon-game\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Maximum Path Quality of a Graph\", \"titleSlug\": \"maximum-path-quality-of-a-graph\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[[0,1,-1],[1,0,-1],[1,1,1]]\n[[1,1,-1],[1,-1,1],[-1,1,1]]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"51.8K\", \"totalSubmission\": \"143.2K\", \"totalAcceptedRaw\": 51764, \"totalSubmissionRaw\": 143167, \"acRate\": \"36.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"51.8K\", \"totalSubmission\": \"143.3K\", \"totalAcceptedRaw\": 51821, \"totalSubmissionRaw\": 143330, \"acRate\": \"36.2%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "311",
|
||||
|
Reference in New Issue
Block a user