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-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
leetcode/originData/[no content]minimum-cost-to-reach-city-with-discounts.json
View File

@@ -11,10 +11,10 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 77,
"dislikes": 5,
"likes": 85,
"dislikes": 6,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Cheapest Flights Within K Stops\", \"titleSlug\": \"cheapest-flights-within-k-stops\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Connecting Cities With Minimum Cost\", \"titleSlug\": \"connecting-cities-with-minimum-cost\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Cost to Reach Destination in Time\", \"titleSlug\": \"minimum-cost-to-reach-destination-in-time\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"similarQuestions": "[{\"title\": \"Cheapest Flights Within K Stops\", \"titleSlug\": \"cheapest-flights-within-k-stops\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Connecting Cities With Minimum Cost\", \"titleSlug\": \"connecting-cities-with-minimum-cost\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Cost of Trip With K Highways\", \"titleSlug\": \"maximum-cost-of-trip-with-k-highways\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Cost to Reach Destination in Time\", \"titleSlug\": \"minimum-cost-to-reach-destination-in-time\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "5\n[[0,1,4],[2,1,3],[1,4,11],[3,2,3],[3,4,2]]\n1\n4\n[[1,3,17],[1,2,7],[3,2,5],[0,1,6],[3,0,20]]\n20\n4\n[[0,1,3],[2,3,2]]\n0",
"categoryTitle": "Algorithms",
"contributors": [],
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"3.3K\", \"totalAcceptedRaw\": 1859, \"totalSubmissionRaw\": 3276, \"acRate\": \"56.7%\"}",
"stats": "{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"3.6K\", \"totalAcceptedRaw\": 2059, \"totalSubmissionRaw\": 3629, \"acRate\": \"56.7%\"}",
"hints": [
"Try to construct a graph out of highways. What type of graph is this?",
"We essentially need to find the minimum distance to get from node 0 to node n - 1 in an undirected weighted graph. What algorithm should we use to do this?",