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/[no content]binary-tree-vertical-order-traversal.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 3071,
"likes": 3072,
"dislikes": 305,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Binary Tree Level Order Traversal\", \"titleSlug\": \"binary-tree-level-order-traversal\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"351.6K\", \"totalSubmission\": \"661.8K\", \"totalAcceptedRaw\": 351638, \"totalSubmissionRaw\": 661812, \"acRate\": \"53.1%\"}",
"stats": "{\"totalAccepted\": \"351.7K\", \"totalSubmission\": \"661.9K\", \"totalAcceptedRaw\": 351682, \"totalSubmissionRaw\": 661882, \"acRate\": \"53.1%\"}",
"hints": [
"Do BFS from the root. Let the root be at column 0. In the BFS, keep in the queue the node and its column.",
"When you traverse a node, store its value in the column index. For example, the root's value should be stored at index 0.",