mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 435,
|
||||
"dislikes": 7,
|
||||
"likes": 446,
|
||||
"dislikes": 10,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Checking Existence of Edge Length Limited Paths II\", \"titleSlug\": \"checking-existence-of-edge-length-limited-paths-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "3\n[[0,1,2],[1,2,4],[2,0,8],[1,0,16]]\n[[0,1,2],[0,2,5]]\n5\n[[0,1,10],[1,2,5],[2,3,9],[3,4,13]]\n[[0,4,14],[1,4,13]]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"15.8K\", \"totalAcceptedRaw\": 7668, \"totalSubmissionRaw\": 15778, \"acRate\": \"48.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"16K\", \"totalAcceptedRaw\": 7815, \"totalSubmissionRaw\": 16040, \"acRate\": \"48.7%\"}",
|
||||
"hints": [
|
||||
"All the queries are given in advance. Is there a way you can reorder the queries to avoid repeated computations?"
|
||||
],
|
||||
|
Reference in New Issue
Block a user