diff --git a/notes/剑指 offer 题解.md b/notes/剑指 offer 题解.md index a60915dc..7fdef7de 100644 --- a/notes/剑指 offer 题解.md +++ b/notes/剑指 offer 题解.md @@ -341,11 +341,11 @@ private TreeNode reConstructBinaryTree(int[] pre, int preL, int preR, int[] in, ① 如果一个节点有右子树不为空,那么该节点的下一个节点是右子树的最左节点; -

+

② 否则,向上找第一个左链接指向的树包含该节点的祖先节点。 -

+

```java public class TreeLinkNode { @@ -914,7 +914,7 @@ public boolean isNumeric(char[] str) { ## 解题思路 -复杂度:O(n2) + O(1) +复杂度:O(N2) + O(1) ```java public void reOrderArray(int[] nums) { @@ -934,7 +934,7 @@ public void reOrderArray(int[] nums) { } ``` -复杂度:O(n) + O(n) +复杂度:O(N) + O(N) ```java public void reOrderArray(int[] nums) { @@ -957,7 +957,7 @@ public void reOrderArray(int[] nums) { ## 解题思路 -

+

```java public ListNode FindKthToTail(ListNode head, int k) { diff --git a/pics/207c1801-2335-4b1b-b65c-126a0ba966cb.png b/pics/207c1801-2335-4b1b-b65c-126a0ba966cb.png new file mode 100644 index 00000000..cace90b3 Binary files /dev/null and b/pics/207c1801-2335-4b1b-b65c-126a0ba966cb.png differ diff --git a/pics/44c37c4c-3f7c-4d59-af8d-65cbd2ab3784.png b/pics/44c37c4c-3f7c-4d59-af8d-65cbd2ab3784.png new file mode 100644 index 00000000..1cafef09 Binary files /dev/null and b/pics/44c37c4c-3f7c-4d59-af8d-65cbd2ab3784.png differ diff --git a/pics/c7491e97-610a-447f-948b-120b60801c37.png b/pics/c7491e97-610a-447f-948b-120b60801c37.png new file mode 100644 index 00000000..03b0d068 Binary files /dev/null and b/pics/c7491e97-610a-447f-948b-120b60801c37.png differ