coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/[no content]checking-existence-of-edge-length-limited-paths-ii.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 45,
"likes": 46,
"dislikes": 6,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Checking Existence of Edge Length Limited Paths\", \"titleSlug\": \"checking-existence-of-edge-length-limited-paths\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1589, \"totalSubmissionRaw\": 3030, \"acRate\": \"52.4%\"}",
"stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1591, \"totalSubmissionRaw\": 3033, \"acRate\": \"52.5%\"}",
"hints": [
"Find the minimum spanning tree of the given graph.",
"Root the tree in an arbitrary node and calculate the maximum weight of the edge from each node to the chosen root.",