mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 00:11:41 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"56.1K\", \"totalSubmission\": \"85.8K\", \"totalAcceptedRaw\": 56089, \"totalSubmissionRaw\": 85782, \"acRate\": \"65.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"56.1K\", \"totalSubmission\": \"85.8K\", \"totalAcceptedRaw\": 56098, \"totalSubmissionRaw\": 85799, \"acRate\": \"65.4%\"}",
|
||||
"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."
|
||||
|
Reference in New Issue
Block a user