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:
小墨
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/number-of-ways-to-arrive-at-destination.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 757,
"likes": 762,
"dislikes": 23,
"isLiked": null,
"similarQuestions": "[{\"title\": \"All Paths From Source to Target\", \"titleSlug\": \"all-paths-from-source-to-target\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Path with Maximum Probability\", \"titleSlug\": \"path-with-maximum-probability\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Second Minimum Time to Reach Destination\", \"titleSlug\": \"second-minimum-time-to-reach-destination\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 13083, \"totalSubmissionRaw\": 39862, \"acRate\": \"32.8%\"}",
"stats": "{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 13189, \"totalSubmissionRaw\": 40129, \"acRate\": \"32.9%\"}",
"hints": [
"First use any shortest path algorithm to get edges where dist[u] + weight = dist[v], here dist[x] is the shortest distance between node 0 and x",
"Using those edges only the graph turns into a dag now we just need to know the number of ways to get from node 0 to node n - 1 on a dag using dp"