feat: add ts solution to lc problem: No.1161

No.1161.Maximum Level Sum of a Binary Tree

Author: YangFong

solution/1100-1199/1161.Maximum Level Sum of a Binary Tree/README.md

@@ -357,6 +357,47 @@ func maxLevelSum(root *TreeNode) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+function maxLevelSum(root: TreeNode | null): number {
+    const queue = [root];
+    let res = 1;
+    let max = -Infinity;
+    let h = 1;
+    while (queue.length !== 0) {
+        const n = queue.length;
+        let sum = 0;
+        for (let i = 0; i < n; i++) {
+            const { val, left, right } = queue.shift();
+            sum += val;
+            left && queue.push(left);
+            right && queue.push(right);
+        }
+        if (sum > max) {
+            max = sum;
+            res = h;
+        }
+        h++;
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

solution/1100-1199/1161.Maximum Level Sum of a Binary Tree/README_EN.md

@@ -337,6 +337,47 @@ func maxLevelSum(root *TreeNode) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+function maxLevelSum(root: TreeNode | null): number {
+    const queue = [root];
+    let res = 1;
+    let max = -Infinity;
+    let h = 1;
+    while (queue.length !== 0) {
+        const n = queue.length;
+        let sum = 0;
+        for (let i = 0; i < n; i++) {
+            const { val, left, right } = queue.shift();
+            sum += val;
+            left && queue.push(left);
+            right && queue.push(right);
+        }
+        if (sum > max) {
+            max = sum;
+            res = h;
+        }
+        h++;
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

solution/1100-1199/1161.Maximum Level Sum of a Binary Tree/Solution.ts

@@ -0,0 +1,36 @@
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+function maxLevelSum(root: TreeNode | null): number {
+    const queue = [root];
+    let res = 1;
+    let max = -Infinity;
+    let h = 1;
+    while (queue.length !== 0) {
+        const n = queue.length;
+        let sum = 0;
+        for (let i = 0; i < n; i++) {
+            const { val, left, right } = queue.shift();
+            sum += val;
+            left && queue.push(left);
+            right && queue.push(right);
+        }
+        if (sum > max) {
+            max = sum;
+            res = h;
+        }
+        h++;
+    }
+    return res;
+}