coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11:41 +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

2
leetcode-cn/originData/number-of-ways-to-arrive-at-destination.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3K\", \"totalSubmission\": \"9.5K\", \"totalAcceptedRaw\": 3026, \"totalSubmissionRaw\": 9486, \"acRate\": \"31.9%\"}",
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"10K\", \"totalAcceptedRaw\": 3219, \"totalSubmissionRaw\": 9975, \"acRate\": \"32.3%\"}",
"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"