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

4
leetcode/originData/shortest-cycle-in-a-graph.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 445,
"likes": 446,
"dislikes": 16,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Redundant Connection\", \"titleSlug\": \"redundant-connection\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Cycle in a Graph\", \"titleSlug\": \"longest-cycle-in-a-graph\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Divide Nodes Into the Maximum Number of Groups\", \"titleSlug\": \"divide-nodes-into-the-maximum-number-of-groups\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.4K\", \"totalSubmission\": \"39.1K\", \"totalAcceptedRaw\": 14355, \"totalSubmissionRaw\": 39144, \"acRate\": \"36.7%\"}",
"stats": "{\"totalAccepted\": \"14.4K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 14360, \"totalSubmissionRaw\": 39153, \"acRate\": \"36.7%\"}",
"hints": [
"How can BFS be used?",
"For each vertex u, calculate the length of the shortest cycle that contains vertex u using BFS"