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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 5859, \"totalSubmissionRaw\": 9030, \"acRate\": \"64.9%\"}",
"stats": "{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"9.1K\", \"totalAcceptedRaw\": 5876, \"totalSubmissionRaw\": 9053, \"acRate\": \"64.9%\"}",
"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.",