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]connecting-cities-with-minimum-cost.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 875,
"likes": 877,
"dislikes": 47,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Cost to Reach City With Discounts\", \"titleSlug\": \"minimum-cost-to-reach-city-with-discounts\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"54.6K\", \"totalSubmission\": \"89.9K\", \"totalAcceptedRaw\": 54598, \"totalSubmissionRaw\": 89853, \"acRate\": \"60.8%\"}",
"stats": "{\"totalAccepted\": \"54.7K\", \"totalSubmission\": \"90K\", \"totalAcceptedRaw\": 54666, \"totalSubmissionRaw\": 89963, \"acRate\": \"60.8%\"}",
"hints": [
"What if we model the cities as a graph?",
"Build a graph of cities and find the minimum spanning tree.",