Sign in
Sign up
Explore
Enterprise
Education
Search
Help
Terms of use
About Us
Explore
Enterprise
Education
Gitee Premium
Gitee AI
AI teammates
Sign in
Sign up
Gitee 2025 OpenSource，We need your vote！
Fetch the repository succeeded.
Open Source
>
Other
>
Tutorial Code
&&
Donate
Please sign in before you donate.
Cancel
Sign in
Scan WeChat QR to Pay
Cancel
Complete
Prompt
Switch to Alipay.
OK
Cancel
Watch
Unwatch
Watching
Releases Only
Ignoring
150
Star
1.9K
Fork
742
programmercarl
/
leetcode-master（代码随想录出品）
Code
Issues
13
Pull Requests
5
Wiki
Insights
Pipelines
Service
JavaDoc
PHPDoc
Quality Analysis
Jenkins for Gitee
Tencent CloudBase
Tencent Cloud Serverless
悬镜安全
Aliyun SAE
Codeblitz
SBOM
Don’t show this again
Update failed. Please try again later!
Remove this flag
Content Risk Flag
This task is identified by
as the content contains sensitive information such as code security bugs, privacy leaks, etc., so it is only accessible to contributors of this repository.
二叉树的统一迭代法JAVA写法简化
Backlog
#I5020X
侯泽冉
Opened this issue
2022-03-29 10:39
看到java 写法中有不必要的 peek 和pop 故简化了一下写法 public List<Integer> inorderTraversal(TreeNode root) { ArrayList<Integer> list = new ArrayList<>(); Stack<TreeNode> stack = new Stack<>(); if (null != root) { stack.push(root); } while (!stack.isEmpty()) { TreeNode node = stack.pop(); if (null != node) { if (node.right != null) { stack.push(node.right); } stack.push(node); stack.push(null); if (node.left != null) { stack.push(node.left); } } else { node = stack.pop(); list.add(node.val); } } return list; }
看到java 写法中有不必要的 peek 和pop 故简化了一下写法 public List<Integer> inorderTraversal(TreeNode root) { ArrayList<Integer> list = new ArrayList<>(); Stack<TreeNode> stack = new Stack<>(); if (null != root) { stack.push(root); } while (!stack.isEmpty()) { TreeNode node = stack.pop(); if (null != node) { if (node.right != null) { stack.push(node.right); } stack.push(node); stack.push(null); if (node.left != null) { stack.push(node.left); } } else { node = stack.pop(); list.add(node.val); } } return list; }
Comments (
0
)
Sign in
to comment
Status
Backlog
Backlog
Doing
Done
Closed
Assignees
Not set
Labels
Not set
Label settings
Milestones
No related milestones
No related milestones
Pull Requests
None yet
None yet
Successfully merging a pull request will close this issue.
Branches
No related branch
No related branch
master
Planed to start - Planed to end
-
Top level
Not Top
Top Level: High
Top Level: Medium
Top Level: Low
Priority
Not specified
Serious
Main
Secondary
Unimportant
参与者（1）
1
https://gitee.com/programmercarl/leetcode-master.git
git@gitee.com:programmercarl/leetcode-master.git
programmercarl
leetcode-master
leetcode-master（代码随想录出品）
Going to Help Center
Search
Git 命令在线学习
如何在 Gitee 导入 GitHub 仓库
Git 仓库基础操作
企业版和社区版功能对比
SSH 公钥设置
如何处理代码冲突
仓库体积过大，如何减小？
如何找回被删除的仓库数据
Gitee 产品配额说明
GitHub仓库快速导入Gitee及同步更新
什么是 Release（发行版）
将 PHP 项目自动发布到 packagist.org
Comment
Repository Report
Back to the top
Login prompt
This operation requires login to the code cloud account. Please log in before operating.
Go to login
No account. Register
