Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2018-04-09 14:29:17 +08:00
parent 4ff4aa96c4
commit 111e9d45de
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
notes/剑指 offer 题解.md
View File

@ -296,7 +296,7 @@ public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
## 题目描述 ## 题目描述
根据二叉树的前序遍历和中序遍历的结果，重建出该二叉树。 根据二叉树的前序遍历和中序遍历的结果，重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
```html ```html
preorder = [3,9,20,15,7] preorder = [3,9,20,15,7]
@ -339,7 +339,7 @@ private TreeNode reConstructBinaryTree(int[] pre, int preL, int preR, int[] in,
## 解题思路 ## 解题思路
① 如果一个节点有右子树不为空，那么该节点的下一个节点是右子树的最左节点； ① 如果一个节点的右子树不为空，那么该节点的下一个节点是右子树的最左节点；
<div align="center"> <img src="../pics//cb0ed469-27ab-471b-a830-648b279103c8.png" width="250"/> </div><br> <div align="center"> <img src="../pics//cb0ed469-27ab-471b-a830-648b279103c8.png" width="250"/> </div><br>
@ -393,7 +393,7 @@ public void push(int node) {
in.push(node); in.push(node);
} }
public int pop() { public int pop() throws Exception {
if (out.isEmpty()) { if (out.isEmpty()) {
while (!in.isEmpty()) { while (!in.isEmpty()) {
out.push(in.pop()); out.push(in.pop());