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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"251.8K\", \"totalSubmission\": \"378.3K\", \"totalAcceptedRaw\": 251763, \"totalSubmissionRaw\": 378264, \"acRate\": \"66.6%\"}",
"stats": "{\"totalAccepted\": \"251.8K\", \"totalSubmission\": \"378.3K\", \"totalAcceptedRaw\": 251802, \"totalSubmissionRaw\": 378330, \"acRate\": \"66.6%\"}",
"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."