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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 560,
"likes": 564,
"dislikes": 98,
"isLiked": null,
"similarQuestions": "[{\"title\": \"All Ancestors of a Node in a Directed Acyclic Graph\", \"titleSlug\": \"all-ancestors-of-a-node-in-a-directed-acyclic-graph\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.2K\", \"totalSubmission\": \"31.7K\", \"totalAcceptedRaw\": 12201, \"totalSubmissionRaw\": 31722, \"acRate\": \"38.5%\"}",
"stats": "{\"totalAccepted\": \"12.2K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 12244, \"totalSubmissionRaw\": 31852, \"acRate\": \"38.4%\"}",
"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.",