coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/[no content]minimum-cost-to-reach-city-with-discounts.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"8.8K\", \"totalAcceptedRaw\": 4880, \"totalSubmissionRaw\": 8813, \"acRate\": \"55.4%\"}",
"stats": "{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"8.8K\", \"totalAcceptedRaw\": 4881, \"totalSubmissionRaw\": 8814, \"acRate\": \"55.4%\"}",
"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?",