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

@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"11.6K\", \"totalSubmission\": \"20.7K\", \"totalAcceptedRaw\": 11608, \"totalSubmissionRaw\": 20686, \"acRate\": \"56.1%\"}",
"stats": "{\"totalAccepted\": \"11.6K\", \"totalSubmission\": \"20.7K\", \"totalAcceptedRaw\": 11611, \"totalSubmissionRaw\": 20689, \"acRate\": \"56.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.",