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-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

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

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 3,
"likes": 4,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"151\", \"totalSubmission\": \"252\", \"totalAcceptedRaw\": 151, \"totalSubmissionRaw\": 252, \"acRate\": \"59.9%\"}",
"stats": "{\"totalAccepted\": \"158\", \"totalSubmission\": \"263\", \"totalAcceptedRaw\": 158, \"totalSubmissionRaw\": 263, \"acRate\": \"60.1%\"}",
"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?",