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

4
leetcode/originData/reverse-odd-levels-of-binary-tree.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1025,
"likes": 1026,
"dislikes": 35,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Invert Binary Tree\", \"titleSlug\": \"invert-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"43.4K\", \"totalSubmission\": \"56K\", \"totalAcceptedRaw\": 43382, \"totalSubmissionRaw\": 56045, \"acRate\": \"77.4%\"}",
"stats": "{\"totalAccepted\": \"43.4K\", \"totalSubmission\": \"56.1K\", \"totalAcceptedRaw\": 43401, \"totalSubmissionRaw\": 56066, \"acRate\": \"77.4%\"}",
"hints": [
"Try to solve recursively for each level independently.",
"While performing a depth-first search, pass the left and right nodes (which should be paired) to the next level. If the current level is odd, then reverse their values, or else recursively move to the next level."