coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +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/number-of-restricted-paths-from-first-to-last-node.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"55.5K\", \"totalAcceptedRaw\": 21651, \"totalSubmissionRaw\": 55528, \"acRate\": \"39.0%\"}",
"stats": "{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"55.5K\", \"totalAcceptedRaw\": 21659, \"totalSubmissionRaw\": 55541, \"acRate\": \"39.0%\"}",
"hints": [
"Run a Dijkstra from node numbered n to compute distance from the last node.",
"Consider all edges [u, v] one by one and direct them such that distance of u to n > distance of v to n. If both u and v are at the same distance from n, discard this edge.",