coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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-good-nodes-in-binary-tree.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 2188,
"dislikes": 74,
"likes": 2287,
"dislikes": 75,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[3,1,4,3,null,1,5]\n[3,3,null,4,2]\n[1]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"154.5K\", \"totalSubmission\": \"211.8K\", \"totalAcceptedRaw\": 154548, \"totalSubmissionRaw\": 211761, \"acRate\": \"73.0%\"}",
"stats": "{\"totalAccepted\": \"159.8K\", \"totalSubmission\": \"219K\", \"totalAcceptedRaw\": 159791, \"totalSubmissionRaw\": 219008, \"acRate\": \"73.0%\"}",
"hints": [
"Use DFS (Depth First Search) to traverse the tree, and constantly keep track of the current path maximum."
],