feat: add typescript solution to lc problem: No.0987

solution/0900-0999/0987.Vertical Order Traversal of a Binary Tree/README.md

@@ -83,6 +83,61 @@
 
 ```
 
+### **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 verticalTraversal(root: TreeNode | null): number[][] {
+    let solution = [];
+    dfs(root, 0, 0, solution);
+    // 优先依据i=2排序， 然后依据i=1排序
+    solution.sort(compare);
+    // console.log(solution);
+    let ans = [];
+    let pre = Number.MIN_SAFE_INTEGER;
+    for (let node of solution) {
+        const [val, , idx] = node;
+        if (idx != pre) {
+            ans.push([]);
+            pre = idx;
+        }
+        ans[ans.length - 1].push(val);
+    }
+    return ans;
+};
+
+function compare(a: Array<number>, b: Array<number>) {
+    const [a0, a1, a2] = a, [b0, b1, b2] = b;
+    if (a2 == b2) {
+        if (a1 == b1) {
+            return a0 - b0;
+        }
+        return a1 - b1;
+    }
+    return a2 - b2;
+}
+
+function dfs(root: TreeNode | null, depth: number, idx: number, solution: Array<Array<number>>) {
+    if (!root) return;
+    solution.push([root.val, depth, idx]);
+    dfs(root.left, depth + 1, idx - 1, solution);
+    dfs(root.right, depth + 1, idx + 1, solution);
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0987.Vertical Order Traversal of a Binary Tree/README_EN.md

@@ -74,6 +74,61 @@ Note that the solution remains the same since 5 and 6 are in the same location a
 
 ```
 
+### **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 verticalTraversal(root: TreeNode | null): number[][] {
+    let solution = [];
+    dfs(root, 0, 0, solution);
+    // 优先依据i=2排序， 然后依据i=1排序
+    solution.sort(compare);
+    // console.log(solution);
+    let ans = [];
+    let pre = Number.MIN_SAFE_INTEGER;
+    for (let node of solution) {
+        const [val, , idx] = node;
+        if (idx != pre) {
+            ans.push([]);
+            pre = idx;
+        }
+        ans[ans.length - 1].push(val);
+    }
+    return ans;
+};
+
+function compare(a: Array<number>, b: Array<number>) {
+    const [a0, a1, a2] = a, [b0, b1, b2] = b;
+    if (a2 == b2) {
+        if (a1 == b1) {
+            return a0 - b0;
+        }
+        return a1 - b1;
+    }
+    return a2 - b2;
+}
+
+function dfs(root: TreeNode | null, depth: number, idx: number, solution: Array<Array<number>>) {
+    if (!root) return;
+    solution.push([root.val, depth, idx]);
+    dfs(root.left, depth + 1, idx - 1, solution);
+    dfs(root.right, depth + 1, idx + 1, solution);
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0987.Vertical Order Traversal of a Binary Tree/Solution.ts

@@ -0,0 +1,50 @@
+/**
+ * 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 verticalTraversal(root: TreeNode | null): number[][] {
+    let solution = [];
+    dfs(root, 0, 0, solution);
+    // 优先依据i=2排序， 然后依据i=1排序
+    solution.sort(compare);
+    // console.log(solution);
+    let ans = [];
+    let pre = Number.MIN_SAFE_INTEGER;
+    for (let node of solution) {
+        const [val, , idx] = node;
+        if (idx != pre) {
+            ans.push([]);
+            pre = idx;
+        }
+        ans[ans.length - 1].push(val);
+    }
+    return ans;
+};
+
+function compare(a: Array<number>, b: Array<number>) {
+    const [a0, a1, a2] = a, [b0, b1, b2] = b;
+    if (a2 == b2) {
+        if (a1 == b1) {
+            return a0 - b0;
+        }
+        return a1 - b1;
+    }
+    return a2 - b2;
+}
+
+function dfs(root: TreeNode | null, depth: number, idx: number, solution: Array<Array<number>>) {
+    if (!root) return;
+    solution.push([root.val, depth, idx]);
+    dfs(root.left, depth + 1, idx - 1, solution);
+    dfs(root.right, depth + 1, idx + 1, solution);
+}