coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/maximum-path-quality-of-a-graph.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 247,
"dislikes": 24,
"likes": 261,
"dislikes": 27,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Cherry Pickup\", \"titleSlug\": \"cherry-pickup\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Cost to Reach Destination in Time\", \"titleSlug\": \"minimum-cost-to-reach-destination-in-time\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[0,32,10,43]\n[[0,1,10],[1,2,15],[0,3,10]]\n49\n[5,10,15,20]\n[[0,1,10],[1,2,10],[0,3,10]]\n30\n[1,2,3,4]\n[[0,1,10],[1,2,11],[2,3,12],[1,3,13]]\n50",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"13.4K\", \"totalAcceptedRaw\": 7703, \"totalSubmissionRaw\": 13398, \"acRate\": \"57.5%\"}",
"stats": "{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 8310, \"totalSubmissionRaw\": 14391, \"acRate\": \"57.7%\"}",
"hints": [
"How many nodes can you visit within maxTime seconds?",
"Can you try every valid path?"