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/originData/make-costs-of-paths-equal-in-a-binary-tree.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.4K\", \"totalSubmission\": \"23K\", \"totalAcceptedRaw\": 13437, \"totalSubmissionRaw\": 23018, \"acRate\": \"58.4%\"}",
"stats": "{\"totalAccepted\": \"13.5K\", \"totalSubmission\": \"23K\", \"totalAcceptedRaw\": 13452, \"totalSubmissionRaw\": 23041, \"acRate\": \"58.4%\"}",
"hints": [
"The path from the root to a leaf that has the maximum cost should not be modified.",
"The optimal way is to increase all other paths to make their costs equal to the path with maximum cost."