chore: update

Author: yanglbme

lcof2/剑指 Offer II 043. 往完全二叉树添加节点/README.md

@@ -301,7 +301,7 @@ class CBTInserter {
             return;
         }
         const q: TreeNode[] = [root];
-        while (q.length > 0) {
+        while (q.length) {
             const t: TreeNode[] = [];
             for (const node of q) {
                 this.tree.push(node);
@@ -355,7 +355,7 @@ var CBTInserter = function (root) {
         return;
     }
     const q = [root];
-    while (q.length > 0) {
+    while (q.length) {
         const t = [];
         for (const node of q) {
             this.tree.push(node);

lcof2/剑指 Offer II 043. 往完全二叉树添加节点/Solution.cpp

@@ -27,7 +27,7 @@ class CBTInserter {
             }
         }
     }
-    
+
     int insert(int val) {
         auto p = tree[(tree.size() - 1) / 2];
         auto node = new TreeNode(val);
@@ -39,7 +39,7 @@ class CBTInserter {
         }
         return p->val;
     }
-    
+
     TreeNode* get_root() {
         return tree[0];
     }

lcof2/剑指 Offer II 043. 往完全二叉树添加节点/Solution.java

@@ -32,7 +32,7 @@ public CBTInserter(TreeNode root) {
             }
         }
     }
-    
+
     public int insert(int val) {
         TreeNode p = tree.get((tree.size() - 1) / 2);
         TreeNode node = new TreeNode(val);
@@ -44,7 +44,7 @@ public int insert(int val) {
         }
         return p.val;
     }
-    
+
     public TreeNode get_root() {
         return tree.get(0);
     }

lcof2/剑指 Offer II 043. 往完全二叉树添加节点/Solution.js

@@ -15,7 +15,7 @@ var CBTInserter = function (root) {
         return;
     }
     const q = [root];
-    while (q.length > 0) {
+    while (q.length) {
         const t = [];
         for (const node of q) {
             this.tree.push(node);

lcof2/剑指 Offer II 043. 往完全二叉树添加节点/Solution.ts

@@ -20,7 +20,7 @@ class CBTInserter {
             return;
         }
         const q: TreeNode[] = [root];
-        while (q.length > 0) {
+        while (q.length) {
             const t: TreeNode[] = [];
             for (const node of q) {
                 this.tree.push(node);

solution/0900-0999/0919.Complete Binary Tree Inserter/README.md

@@ -308,7 +308,7 @@ class CBTInserter {
             return;
         }
         const q: TreeNode[] = [root];
-        while (q.length > 0) {
+        while (q.length) {
             const t: TreeNode[] = [];
             for (const node of q) {
                 this.tree.push(node);
@@ -362,7 +362,7 @@ var CBTInserter = function (root) {
         return;
     }
     const q = [root];
-    while (q.length > 0) {
+    while (q.length) {
         const t = [];
         for (const node of q) {
             this.tree.push(node);

solution/0900-0999/0919.Complete Binary Tree Inserter/README_EN.md

@@ -301,7 +301,7 @@ class CBTInserter {
             return;
         }
         const q: TreeNode[] = [root];
-        while (q.length > 0) {
+        while (q.length) {
             const t: TreeNode[] = [];
             for (const node of q) {
                 this.tree.push(node);
@@ -355,7 +355,7 @@ var CBTInserter = function (root) {
         return;
     }
     const q = [root];
-    while (q.length > 0) {
+    while (q.length) {
         const t = [];
         for (const node of q) {
             this.tree.push(node);

solution/0900-0999/0919.Complete Binary Tree Inserter/Solution.cpp

@@ -27,7 +27,7 @@ class CBTInserter {
             }
         }
     }
-    
+
     int insert(int val) {
         auto p = tree[(tree.size() - 1) / 2];
         auto node = new TreeNode(val);
@@ -39,7 +39,7 @@ class CBTInserter {
         }
         return p->val;
     }
-    
+
     TreeNode* get_root() {
         return tree[0];
     }

solution/0900-0999/0919.Complete Binary Tree Inserter/Solution.java

@@ -32,7 +32,7 @@ public CBTInserter(TreeNode root) {
             }
         }
     }
-    
+
     public int insert(int val) {
         TreeNode p = tree.get((tree.size() - 1) / 2);
         TreeNode node = new TreeNode(val);
@@ -44,7 +44,7 @@ public int insert(int val) {
         }
         return p.val;
     }
-    
+
     public TreeNode get_root() {
         return tree.get(0);
     }

solution/0900-0999/0919.Complete Binary Tree Inserter/Solution.js

@@ -15,7 +15,7 @@ var CBTInserter = function (root) {
         return;
     }
     const q = [root];
-    while (q.length > 0) {
+    while (q.length) {
         const t = [];
         for (const node of q) {
             this.tree.push(node);

solution/0900-0999/0919.Complete Binary Tree Inserter/Solution.ts

@@ -20,7 +20,7 @@ class CBTInserter {
             return;
         }
         const q: TreeNode[] = [root];
-        while (q.length > 0) {
+        while (q.length) {
             const t: TreeNode[] = [];
             for (const node of q) {
                 this.tree.push(node);