mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 43,
|
||||
"likes": 49,
|
||||
"dislikes": 4,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Number of Connected Components in an Undirected Graph\", \"titleSlug\": \"number-of-connected-components-in-an-undirected-graph\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Reachable Nodes In Subdivided Graph\", \"titleSlug\": \"reachable-nodes-in-subdivided-graph\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Distance to a Cycle in Undirected Graph\", \"titleSlug\": \"distance-to-a-cycle-in-undirected-graph\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Find if Path Exists in Graph\", \"titleSlug\": \"find-if-path-exists-in-graph\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
@@ -28,7 +28,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"2.6K\", \"totalAcceptedRaw\": 1529, \"totalSubmissionRaw\": 2643, \"acRate\": \"57.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.9K\", \"totalAcceptedRaw\": 1675, \"totalSubmissionRaw\": 2925, \"acRate\": \"57.3%\"}",
|
||||
"hints": [
|
||||
"If the path starts at room i, what properties must the other two rooms in the cycle have?",
|
||||
"The other two rooms must be connected to room i, and must be connected to each other."
|
||||
|
Reference in New Issue
Block a user