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

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

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2K\", \"totalSubmission\": \"3.2K\", \"totalAcceptedRaw\": 1993, \"totalSubmissionRaw\": 3183, \"acRate\": \"62.6%\"}",
"stats": "{\"totalAccepted\": \"2K\", \"totalSubmission\": \"3.2K\", \"totalAcceptedRaw\": 2036, \"totalSubmissionRaw\": 3243, \"acRate\": \"62.8%\"}",
"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.",