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

2
leetcode-cn/originData/minimum-edge-reversals-so-every-node-is-reachable.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"2.6K\", \"totalAcceptedRaw\": 1863, \"totalSubmissionRaw\": 2612, \"acRate\": \"71.3%\"}",
"stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"2.6K\", \"totalAcceptedRaw\": 1867, \"totalSubmissionRaw\": 2616, \"acRate\": \"71.4%\"}",
"hints": [
"The problem can be solved using tree DP.",
"Using node <code>0</code> as the root, let <code>dp[x]</code> be the minimum number of edge reversals so node <code>x</code> can reach every node in its subtree.",