diff --git a/docs/notes/剑指 Offer 题解 - 3~9.md b/docs/notes/剑指 Offer 题解 - 3~9.md index 5f64ce6e..640b0991 100644 --- a/docs/notes/剑指 Offer 题解 - 3~9.md +++ b/docs/notes/剑指 Offer 题解 - 3~9.md @@ -243,18 +243,14 @@ public ArrayList printListFromTailToHead(ListNode listNode) { 根据二叉树的前序遍历和中序遍历的结果，重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。 -```html -preorder = [3,9,20,15,7] -inorder = [9,3,15,20,7] -``` -

+

## 解题思路 前序遍历的第一个值为根节点的值，使用这个值将中序遍历结果分成两部分，左部分为树的左子树中序遍历结果，右部分为树的右子树中序遍历的结果。 -

+

```java // 缓存中序遍历数组每个值对应的索引 diff --git a/docs/pics/31d9adce-2af8-4754-8386-0aabb4e500b0.png b/docs/pics/31d9adce-2af8-4754-8386-0aabb4e500b0.png new file mode 100644 index 00000000..1248f60f Binary files /dev/null and b/docs/pics/31d9adce-2af8-4754-8386-0aabb4e500b0.png differ diff --git a/docs/pics/c269e362-1128-4212-9cf3-d4c12b363b2f.gif b/docs/pics/c269e362-1128-4212-9cf3-d4c12b363b2f.gif new file mode 100644 index 00000000..e372dea1 Binary files /dev/null and b/docs/pics/c269e362-1128-4212-9cf3-d4c12b363b2f.gif differ diff --git a/notes/pics/31d9adce-2af8-4754-8386-0aabb4e500b0.png b/notes/pics/31d9adce-2af8-4754-8386-0aabb4e500b0.png new file mode 100644 index 00000000..1248f60f Binary files /dev/null and b/notes/pics/31d9adce-2af8-4754-8386-0aabb4e500b0.png differ diff --git a/notes/pics/c269e362-1128-4212-9cf3-d4c12b363b2f.gif b/notes/pics/c269e362-1128-4212-9cf3-d4c12b363b2f.gif new file mode 100644 index 00000000..e372dea1 Binary files /dev/null and b/notes/pics/c269e362-1128-4212-9cf3-d4c12b363b2f.gif differ diff --git a/notes/剑指 Offer 题解 - 3~9.md b/notes/剑指 Offer 题解 - 3~9.md index c51aedab..07f91d53 100644 --- a/notes/剑指 Offer 题解 - 3~9.md +++ b/notes/剑指 Offer 题解 - 3~9.md @@ -243,18 +243,14 @@ public ArrayList printListFromTailToHead(ListNode listNode) { 根据二叉树的前序遍历和中序遍历的结果，重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。 -```html -preorder = [3,9,20,15,7] -inorder = [9,3,15,20,7] -``` -

+

## 解题思路 前序遍历的第一个值为根节点的值，使用这个值将中序遍历结果分成两部分，左部分为树的左子树中序遍历结果，右部分为树的右子树中序遍历的结果。 -

+

```java // 缓存中序遍历数组每个值对应的索引