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": "Medium",
|
||||
"likes": 4674,
|
||||
"dislikes": 201,
|
||||
"likes": 4792,
|
||||
"dislikes": 215,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Maximum Vacation Days\", \"titleSlug\": \"maximum-vacation-days\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Cost to Reach City With Discounts\", \"titleSlug\": \"minimum-cost-to-reach-city-with-discounts\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "4\n[[0,1,100],[1,2,100],[2,0,100],[1,3,600],[2,3,200]]\n0\n3\n1\n3\n[[0,1,100],[1,2,100],[0,2,500]]\n0\n2\n1\n3\n[[0,1,100],[1,2,100],[0,2,500]]\n0\n2\n0",
|
||||
@@ -167,7 +167,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"223.3K\", \"totalSubmission\": \"618.6K\", \"totalAcceptedRaw\": 223284, \"totalSubmissionRaw\": 618633, \"acRate\": \"36.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"229.3K\", \"totalSubmission\": \"636.8K\", \"totalAcceptedRaw\": 229295, \"totalSubmissionRaw\": 636750, \"acRate\": \"36.0%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "957",
|
||||
|
Reference in New Issue
Block a user