coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 22:13:28 +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

4
leetcode-cn/originData/[no content]distance-to-a-cycle-in-undirected-graph.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 2,
"likes": 6,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"37\", \"totalSubmission\": \"50\", \"totalAcceptedRaw\": 37, \"totalSubmissionRaw\": 50, \"acRate\": \"74.0%\"}",
"stats": "{\"totalAccepted\": \"70\", \"totalSubmission\": \"85\", \"totalAcceptedRaw\": 70, \"totalSubmissionRaw\": 85, \"acRate\": \"82.4%\"}",
"hints": [
"This problem can be broken down into two parts: finding the cycle, and finding the distance between each node and the cycle.",
"How can we find the cycle? We can use DFS and keep track of the nodes we’ve seen, and the order that we see them in. Once we see a node we’ve already visited, we know that the cycle contains the node that was seen twice and all the nodes that we visited in between.",