feat: update ts solution to lc problem: No.199 (doocs#2821)

Author: rain84

solution/0100-0199/0199.Binary Tree Right Side View/README.md

@@ -213,19 +213,23 @@ func rightSideView(root *TreeNode) (ans []int) {
  */
 
 function rightSideView(root: TreeNode | null): number[] {
-    const ans = [];
     if (!root) {
-        return ans;
+        return [];
     }
-    const q = [root];
+    let q = [root];
+    const ans: number[] = [];
     while (q.length) {
-        const n = q.length;
-        ans.push(q[n - 1].val);
-        for (let i = 0; i < n; ++i) {
-            const { left, right } = q.shift();
-            left && q.push(left);
-            right && q.push(right);
+        const nextq: TreeNode[] = [];
+        ans.push(q.at(-1)!.val);
+        for (const { left, right } of q) {
+            if (left) {
+                nextq.push(left);
+            }
+            if (right) {
+                nextq.push(right);
+            }
         }
+        q = nextq;
     }
     return ans;
 }

solution/0100-0199/0199.Binary Tree Right Side View/README_EN.md

@@ -203,19 +203,23 @@ func rightSideView(root *TreeNode) (ans []int) {
  */
 
 function rightSideView(root: TreeNode | null): number[] {
-    const ans = [];
     if (!root) {
-        return ans;
+        return [];
     }
-    const q = [root];
+    let q = [root];
+    const ans: number[] = [];
     while (q.length) {
-        const n = q.length;
-        ans.push(q[n - 1].val);
-        for (let i = 0; i < n; ++i) {
-            const { left, right } = q.shift();
-            left && q.push(left);
-            right && q.push(right);
+        const nextq: TreeNode[] = [];
+        ans.push(q.at(-1)!.val);
+        for (const { left, right } of q) {
+            if (left) {
+                nextq.push(left);
+            }
+            if (right) {
+                nextq.push(right);
+            }
         }
+        q = nextq;
     }
     return ans;
 }

solution/0100-0199/0199.Binary Tree Right Side View/Solution.ts

@@ -13,19 +13,23 @@
  */
 
 function rightSideView(root: TreeNode | null): number[] {
-    const ans = [];
     if (!root) {
-        return ans;
+        return [];
     }
-    const q = [root];
+    let q = [root];
+    const ans: number[] = [];
     while (q.length) {
-        const n = q.length;
-        ans.push(q[n - 1].val);
-        for (let i = 0; i < n; ++i) {
-            const { left, right } = q.shift();
-            left && q.push(left);
-            right && q.push(right);
+        const nextq: TreeNode[] = [];
+        ans.push(q.at(-1)!.val);
+        for (const { left, right } of q) {
+            if (left) {
+                nextq.push(left);
+            }
+            if (right) {
+                nextq.push(right);
+            }
         }
+        q = nextq;
     }
     return ans;
 }