feat: add solutions to lc/lcof2 problems

* lc No.0919 & lcof2 No.043.Complete Binary Tree Inserter

Author: yanglbme

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

@@ -65,37 +65,36 @@
 #         self.left = left
 #         self.right = right
 class CBTInserter:
-
     def __init__(self, root: TreeNode):
         self.tree = []
         q = deque([root])
         while q:
-            n = len(q)
-            for _ in range(n):
+            for _ in range(len(q)):
                 node = q.popleft()
                 self.tree.append(node)
                 if node.left:
                     q.append(node.left)
                 if node.right:
                     q.append(node.right)
 
-    def insert(self, val: int) -> int:
-        pidx = (len(self.tree) - 1) >> 1
-        node = TreeNode(val=val)
+    def insert(self, v: int) -> int:
+        pid = (len(self.tree) - 1) >> 1
+        node = TreeNode(v)
         self.tree.append(node)
-        if self.tree[pidx].left is None:
-            self.tree[pidx].left = node
+        p = self.tree[pid]
+        if p.left is None:
+            p.left = node
         else:
-            self.tree[pidx].right = node
-        return self.tree[pidx].val
+            p.right = node
+        return p.val
 
     def get_root(self) -> TreeNode:
         return self.tree[0]
 
 
 # Your CBTInserter object will be instantiated and called as such:
 # obj = CBTInserter(root)
-# param_1 = obj.insert(val)
+# param_1 = obj.insert(v)
 # param_2 = obj.get_root()
 ```
 
@@ -125,31 +124,32 @@ class CBTInserter {
     public CBTInserter(TreeNode root) {
         tree = new ArrayList<>();
         Deque<TreeNode> q = new ArrayDeque<>();
-        q.offerLast(root);
+        q.offer(root);
         while (!q.isEmpty()) {
             TreeNode node = q.pollFirst();
             tree.add(node);
             if (node.left != null) {
-                q.offerLast(node.left);
+                q.offer(node.left);
             }
             if (node.right != null) {
-                q.offerLast(node.right);
+                q.offer(node.right);
             }
         }
     }
-
-    public int insert(int val) {
-        int pidx = (tree.size() - 1) >> 1;
-        TreeNode node = new TreeNode(val);
+    
+    public int insert(int v) {
+        int pid = (tree.size() - 1) >> 1;
+        TreeNode node = new TreeNode(v);
         tree.add(node);
-        if (tree.get(pidx).left == null) {
-            tree.get(pidx).left = node;
+        TreeNode p = tree.get(pid);
+        if (p.left == null) {
+            p.left = node;
         } else {
-            tree.get(pidx).right = node;
+            p.right = node;
         }
-        return tree.get(pidx).val;
+        return p.val;
     }
-
+    
     public TreeNode get_root() {
         return tree.get(0);
     }
@@ -158,7 +158,7 @@ class CBTInserter {
 /**
  * Your CBTInserter object will be instantiated and called as such:
  * CBTInserter obj = new CBTInserter(root);
- * int param_1 = obj.insert(val);
+ * int param_1 = obj.insert(v);
  * TreeNode param_2 = obj.get_root();
  */
 ```
@@ -182,8 +182,7 @@ public:
     vector<TreeNode*> tree;
 
     CBTInserter(TreeNode* root) {
-        queue<TreeNode*> q;
-        q.push(root);
+        queue<TreeNode*> q{{root}};
         while (!q.empty())
         {
             auto node = q.front();
@@ -193,16 +192,17 @@ public:
             if (node->right) q.push(node->right);
         }
     }
-
-    int insert(int val) {
-        int pidx = tree.size() - 1 >> 1;
-        TreeNode* node = new TreeNode(val);
+    
+    int insert(int v) {
+        int pid = tree.size() - 1 >> 1;
+        TreeNode* node = new TreeNode(v);
         tree.push_back(node);
-        if (!tree[pidx]->left) tree[pidx]->left = node;
-        else tree[pidx]->right = node;
-        return tree[pidx]->val;
+        TreeNode* p = tree[pid];
+        if (!p->left) p->left = node;
+        else p->right = node;
+        return p->val;
     }
-
+    
     TreeNode* get_root() {
         return tree[0];
     }
@@ -211,7 +211,7 @@ public:
 /**
  * Your CBTInserter object will be instantiated and called as such:
  * CBTInserter* obj = new CBTInserter(root);
- * int param_1 = obj->insert(val);
+ * int param_1 = obj->insert(v);
  * TreeNode* param_2 = obj->get_root();
  */
 ```
@@ -232,9 +232,8 @@ type CBTInserter struct {
 }
 
 func Constructor(root *TreeNode) CBTInserter {
-	var q []*TreeNode
-	var tree []*TreeNode
-	q = append(q, root)
+	q := []*TreeNode{root}
+	tree := []*TreeNode{}
 	for len(q) > 0 {
 		node := q[0]
 		tree = append(tree, node)
@@ -249,16 +248,17 @@ func Constructor(root *TreeNode) CBTInserter {
 	return CBTInserter{tree}
 }
 
-func (this *CBTInserter) Insert(val int) int {
-	pidx := (len(this.tree) - 1) >> 1
-	node := &TreeNode{Val: val}
+func (this *CBTInserter) Insert(v int) int {
+	pid := (len(this.tree) - 1) >> 1
+	node := &TreeNode{Val: v}
 	this.tree = append(this.tree, node)
-	if this.tree[pidx].Left == nil {
-		this.tree[pidx].Left = node
+	p := this.tree[pid]
+	if p.Left == nil {
+		p.Left = node
 	} else {
-		this.tree[pidx].Right = node
+		p.Right = node
 	}
-	return this.tree[pidx].Val
+	return p.Val
 }
 
 func (this *CBTInserter) Get_root() *TreeNode {
@@ -268,11 +268,72 @@ func (this *CBTInserter) Get_root() *TreeNode {
 /**
  * Your CBTInserter object will be instantiated and called as such:
  * obj := Constructor(root);
- * param_1 := obj.Insert(val);
+ * param_1 := obj.Insert(v);
  * param_2 := obj.Get_root();
  */
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ */
+var CBTInserter = function (root) {
+    this.tree = [];
+    const q = [root];
+    while (q.length) {
+        const node = q.shift();
+        this.tree.push(node);
+        if (node.left) {
+            q.push(node.left);
+        }
+        if (node.right) {
+            q.push(node.right);
+        }
+    }
+};
+
+/**
+ * @param {number} v
+ * @return {number}
+ */
+CBTInserter.prototype.insert = function (v) {
+    const pid = (this.tree.length - 1) >> 1;
+    const node = new TreeNode(v);
+    this.tree.push(node);
+    const p = this.tree[pid];
+    if (!p.left) {
+        p.left = node;
+    } else {
+        p.right = node;
+    }
+    return p.val;
+};
+
+/**
+ * @return {TreeNode}
+ */
+CBTInserter.prototype.get_root = function () {
+    return this.tree[0];
+};
+
+/**
+ * Your CBTInserter object will be instantiated and called as such:
+ * var obj = new CBTInserter(root)
+ * var param_1 = obj.insert(v)
+ * var param_2 = obj.get_root()
+ */
+```
+
 ### **...**
 
 ```

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

@@ -14,8 +14,7 @@ class CBTInserter {
     vector<TreeNode*> tree;
 
     CBTInserter(TreeNode* root) {
-        queue<TreeNode*> q;
-        q.push(root);
+        queue<TreeNode*> q{{root}};
         while (!q.empty())
         {
             auto node = q.front();
@@ -26,13 +25,14 @@ class CBTInserter {
         }
     }
 
-    int insert(int val) {
-        int pidx = tree.size() - 1 >> 1;
-        TreeNode* node = new TreeNode(val);
+    int insert(int v) {
+        int pid = tree.size() - 1 >> 1;
+        TreeNode* node = new TreeNode(v);
         tree.push_back(node);
-        if (!tree[pidx]->left) tree[pidx]->left = node;
-        else tree[pidx]->right = node;
-        return tree[pidx]->val;
+        TreeNode* p = tree[pid];
+        if (!p->left) p->left = node;
+        else p->right = node;
+        return p->val;
     }
 
     TreeNode* get_root() {
@@ -43,6 +43,6 @@ class CBTInserter {
 /**
  * Your CBTInserter object will be instantiated and called as such:
  * CBTInserter* obj = new CBTInserter(root);
- * int param_1 = obj->insert(val);
+ * int param_1 = obj->insert(v);
  * TreeNode* param_2 = obj->get_root();
  */

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

@@ -11,9 +11,8 @@ type CBTInserter struct {
 }
 
 func Constructor(root *TreeNode) CBTInserter {
-	var q []*TreeNode
-	var tree []*TreeNode
-	q = append(q, root)
+	q := []*TreeNode{root}
+	tree := []*TreeNode{}
 	for len(q) > 0 {
 		node := q[0]
 		tree = append(tree, node)
@@ -28,16 +27,17 @@ func Constructor(root *TreeNode) CBTInserter {
 	return CBTInserter{tree}
 }
 
-func (this *CBTInserter) Insert(val int) int {
-	pidx := (len(this.tree) - 1) >> 1
-	node := &TreeNode{Val: val}
+func (this *CBTInserter) Insert(v int) int {
+	pid := (len(this.tree) - 1) >> 1
+	node := &TreeNode{Val: v}
 	this.tree = append(this.tree, node)
-	if this.tree[pidx].Left == nil {
-		this.tree[pidx].Left = node
+	p := this.tree[pid]
+	if p.Left == nil {
+		p.Left = node
 	} else {
-		this.tree[pidx].Right = node
+		p.Right = node
 	}
-	return this.tree[pidx].Val
+	return p.Val
 }
 
 func (this *CBTInserter) Get_root() *TreeNode {
@@ -47,6 +47,6 @@ func (this *CBTInserter) Get_root() *TreeNode {
 /**
  * Your CBTInserter object will be instantiated and called as such:
  * obj := Constructor(root);
- * param_1 := obj.Insert(val);
+ * param_1 := obj.Insert(v);
  * param_2 := obj.Get_root();
  */

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

@@ -19,29 +19,30 @@ class CBTInserter {
     public CBTInserter(TreeNode root) {
         tree = new ArrayList<>();
         Deque<TreeNode> q = new ArrayDeque<>();
-        q.offerLast(root);
+        q.offer(root);
         while (!q.isEmpty()) {
             TreeNode node = q.pollFirst();
             tree.add(node);
             if (node.left != null) {
-                q.offerLast(node.left);
+                q.offer(node.left);
             }
             if (node.right != null) {
-                q.offerLast(node.right);
+                q.offer(node.right);
             }
         }
     }
 
-    public int insert(int val) {
-        int pidx = (tree.size() - 1) >> 1;
-        TreeNode node = new TreeNode(val);
+    public int insert(int v) {
+        int pid = (tree.size() - 1) >> 1;
+        TreeNode node = new TreeNode(v);
         tree.add(node);
-        if (tree.get(pidx).left == null) {
-            tree.get(pidx).left = node;
+        TreeNode p = tree.get(pid);
+        if (p.left == null) {
+            p.left = node;
         } else {
-            tree.get(pidx).right = node;
+            p.right = node;
         }
-        return tree.get(pidx).val;
+        return p.val;
     }
 
     public TreeNode get_root() {
@@ -52,6 +53,6 @@ public TreeNode get_root() {
 /**
  * Your CBTInserter object will be instantiated and called as such:
  * CBTInserter obj = new CBTInserter(root);
- * int param_1 = obj.insert(val);
+ * int param_1 = obj.insert(v);
  * TreeNode param_2 = obj.get_root();
  */