coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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/minimum-cost-to-reach-destination-in-time.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 419,
"likes": 420,
"dislikes": 6,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum Path Quality of a Graph\", \"titleSlug\": \"maximum-path-quality-of-a-graph\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Cost to Reach City With Discounts\", \"titleSlug\": \"minimum-cost-to-reach-city-with-discounts\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"25.6K\", \"totalAcceptedRaw\": 9520, \"totalSubmissionRaw\": 25597, \"acRate\": \"37.2%\"}",
"stats": "{\"totalAccepted\": \"9.6K\", \"totalSubmission\": \"25.7K\", \"totalAcceptedRaw\": 9553, \"totalSubmissionRaw\": 25685, \"acRate\": \"37.2%\"}",
"hints": [
"Consider a new graph where each node is one of the old nodes at a specific time. For example, node 0 at time 5.",
"You need to find the shortest path in the new graph."