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": 302,
|
||||
"dislikes": 4,
|
||||
"likes": 316,
|
||||
"dislikes": 5,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Network Delay Time\", \"titleSlug\": \"network-delay-time\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find the City With the Smallest Number of Neighbors at a Threshold Distance\", \"titleSlug\": \"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Number of Ways to Arrive at Destination\", \"titleSlug\": \"number-of-ways-to-arrive-at-destination\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "5\n[[1,2],[1,3],[1,4],[3,4],[4,5]]\n3\n5\n2\n[[1,2]]\n3\n2",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"15.6K\", \"totalAcceptedRaw\": 5679, \"totalSubmissionRaw\": 15607, \"acRate\": \"36.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"16K\", \"totalAcceptedRaw\": 5883, \"totalSubmissionRaw\": 16041, \"acRate\": \"36.7%\"}",
|
||||
"hints": [
|
||||
"How much is change actually necessary while calculating the required path?",
|
||||
"How many extra edges do we need to add to the shortest path?"
|
||||
|
Reference in New Issue
Block a user