coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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

6
leetcode/originData/min-cost-to-connect-all-points.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1157,
"dislikes": 44,
"likes": 1160,
"dislikes": 45,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Number of Lines to Cover Points\", \"titleSlug\": \"minimum-number-of-lines-to-cover-points\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[0,0],[2,2],[3,10],[5,2],[7,0]]\n[[3,12],[-2,5],[-4,1]]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"52.6K\", \"totalSubmission\": \"86K\", \"totalAcceptedRaw\": 52648, \"totalSubmissionRaw\": 85950, \"acRate\": \"61.3%\"}",
"stats": "{\"totalAccepted\": \"52.9K\", \"totalSubmission\": \"86.3K\", \"totalAcceptedRaw\": 52887, \"totalSubmissionRaw\": 86293, \"acRate\": \"61.3%\"}",
"hints": [
"Connect each pair of points with a weighted edge, the weight being the manhattan distance between those points.",
"The problem is now the cost of minimum spanning tree in graph with above edges."