From 8c774c6feb64398ae05214906710b4e2fd0109ed Mon Sep 17 00:00:00 2001
From: "wenbin.tan" <wenbin.tan@dmall.com>
Date: Thu, 4 May 2023 17:38:35 +0800
Subject: [PATCH] =?UTF-8?q?fix(code-9.6):=E6=B2=A1=E6=9C=89=E8=80=83?=
 =?UTF-8?q?=E8=99=91n2.children=20=E4=B8=BA=E6=95=B0=E7=BB=84,n1.children?=
 =?UTF-8?q?=20=E4=B8=BA=E5=AD=97=E7=AC=A6=E4=B8=B2=E7=9A=84=E6=83=85?=
 =?UTF-8?q?=E5=86=B5?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../code-9.6.html"                            | 96 ++++++++++---------
 1 file changed, 51 insertions(+), 45 deletions(-)

diff --git "a/course5-\346\270\262\346\237\223\345\231\250/code-9.6.html" "b/course5-\346\270\262\346\237\223\345\231\250/code-9.6.html"
index ce3d167..ca07a97 100644
--- "a/course5-\346\270\262\346\237\223\345\231\250/code-9.6.html"
+++ "b/course5-\346\270\262\346\237\223\345\231\250/code-9.6.html"
@@ -44,61 +44,67 @@
       }
       setElementText(container, n2.children)
     } else if (Array.isArray(n2.children)) {
-      const oldChildren = n1.children
-      const newChildren = n2.children
+      if(Array.isArray(n1.children)){
+        const oldChildren = n1.children
+        const newChildren = n2.children
 
-      let lastIndex = 0
-      // 遍历新的 children
-      for (let i = 0; i < newChildren.length; i++) {
-        const newVNode = newChildren[i]
-        let j = 0
-        let find = false
-        // 遍历旧的 children
-        for (j; j < oldChildren.length; j++) {
-          const oldVNode = oldChildren[j]
-          // 如果找到了具有相同 key 值的两个节点，则调用 `patch` 函数更新之
-          if (newVNode.key === oldVNode.key) {
-            find = true
-            patch(oldVNode, newVNode, container)
-            if (j < lastIndex) {
-              // 需要移动
-              const prevVNode = newChildren[i - 1]
-              if (prevVNode) {
-                const anchor = prevVNode.el.nextSibling
-                insert(newVNode.el, container, anchor)
+        let lastIndex = 0
+        // 遍历新的 children
+        for (let i = 0; i < newChildren.length; i++) {
+          const newVNode = newChildren[i]
+          let j = 0
+          let find = false
+          // 遍历旧的 children
+          for (j; j < oldChildren.length; j++) {
+            const oldVNode = oldChildren[j]
+            // 如果找到了具有相同 key 值的两个节点，则调用 `patch` 函数更新之
+            if (newVNode.key === oldVNode.key) {
+              find = true
+              patch(oldVNode, newVNode, container)
+              if (j < lastIndex) {
+                // 需要移动
+                const prevVNode = newChildren[i - 1]
+                if (prevVNode) {
+                  const anchor = prevVNode.el.nextSibling
+                  insert(newVNode.el, container, anchor)
+                }
+              } else {
+                // 更新 lastIndex
+                lastIndex = j
               }
-            } else {
-              // 更新 lastIndex
-              lastIndex = j
+              break // 这里需要 break
             }
-            break // 这里需要 break
           }
-        }
-        if (!find) {
-          const prevVNode = newChildren[i - 1]
-          let anchor = null
-          if (prevVNode) {
-            anchor = prevVNode.el.nextSibling
-          } else {
-            anchor = container.firstChild
+          if (!find) {
+            const prevVNode = newChildren[i - 1]
+            let anchor = null
+            if (prevVNode) {
+              anchor = prevVNode.el.nextSibling
+            } else {
+              anchor = container.firstChild
+            }
+            patch(null, newVNode, container, anchor)
           }
-          patch(null, newVNode, container, anchor)
         }
-      }
 
-      // 遍历旧的节点
-      for (let i = 0; i < oldChildren.length; i++) {
-        const oldVNode = oldChildren[i]
-        // 拿着旧 VNode 去新 children 中寻找相同的节点
-        const has = newChildren.find(
-          vnode => vnode.key === oldVNode.key
-        )
-        if (!has) {
-          // 如果没有找到相同的节点，则移除
-          unmount(oldVNode)
+        // 遍历旧的节点
+        for (let i = 0; i < oldChildren.length; i++) {
+          const oldVNode = oldChildren[i]
+          // 拿着旧 VNode 去新 children 中寻找相同的节点
+          const has = newChildren.find(
+            vnode => vnode.key === oldVNode.key
+          )
+          if (!has) {
+            // 如果没有找到相同的节点，则移除
+            unmount(oldVNode)
+          }
         }
+      } else{
+        setElementText(container, '')
+        n2.children.forEach(c => patch(null, c, container))
       }
       
+      
     } else {
       if (Array.isArray(n1.children)) {
         n1.children.forEach(c => unmount(c))