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

6
leetcode/originData/count-subtrees-with-max-distance-between-cities.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 289,
"dislikes": 28,
"likes": 299,
"dislikes": 29,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Tree Diameter\", \"titleSlug\": \"tree-diameter\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "4\n[[1,2],[2,3],[2,4]]\n2\n[[1,2]]\n3\n[[1,2],[2,3]]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"9.1K\", \"totalAcceptedRaw\": 5876, \"totalSubmissionRaw\": 9053, \"acRate\": \"64.9%\"}",
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"9.4K\", \"totalAcceptedRaw\": 6116, \"totalSubmissionRaw\": 9357, \"acRate\": \"65.4%\"}",
"hints": [
"Iterate through every possible subtree by doing a bitmask on which vertices to include. How can you determine if a subtree is valid (all vertices are connected)?",
"To determine connectivity, count the number of reachable vertices starting from any included vertex and only traveling on edges connecting 2 vertices in the subtree. The count should be the same as the number of 1s in the bitmask.",