coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 08:51:42 +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-cn/originData/number-of-ways-to-arrive-at-destination.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7K\", \"totalSubmission\": \"18.8K\", \"totalAcceptedRaw\": 6957, \"totalSubmissionRaw\": 18774, \"acRate\": \"37.1%\"}",
"stats": "{\"totalAccepted\": \"7K\", \"totalSubmission\": \"18.8K\", \"totalAcceptedRaw\": 6963, \"totalSubmissionRaw\": 18782, \"acRate\": \"37.1%\"}",
"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"