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

No.1379.Find a Corresponding Node of a Binary Tree in a Clone of That Tree

Author: YangFong

solution/1300-1399/1379.Find a Corresponding Node of a Binary Tree in a Clone of That Tree/README.md

@@ -176,6 +176,41 @@ public:
 };
 ```
 
+### **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 getTargetCopy(
+    original: TreeNode | null,
+    cloned: TreeNode | null,
+    target: TreeNode | null,
+): TreeNode | null {
+    if (cloned === null) {
+        return null;
+    }
+    if (cloned.val === target.val) {
+        return cloned;
+    }
+    return (
+        getTargetCopy(original, cloned.left, target) ||
+        getTargetCopy(original, cloned.right, target)
+    );
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1379.Find a Corresponding Node of a Binary Tree in a Clone of That Tree/README_EN.md

@@ -152,6 +152,41 @@ public:
 };
 ```
 
+### **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 getTargetCopy(
+    original: TreeNode | null,
+    cloned: TreeNode | null,
+    target: TreeNode | null,
+): TreeNode | null {
+    if (cloned === null) {
+        return null;
+    }
+    if (cloned.val === target.val) {
+        return cloned;
+    }
+    return (
+        getTargetCopy(original, cloned.left, target) ||
+        getTargetCopy(original, cloned.right, target)
+    );
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1379.Find a Corresponding Node of a Binary Tree in a Clone of That Tree/Solution.ts

@@ -0,0 +1,30 @@
+/**
+ * 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 getTargetCopy(
+    original: TreeNode | null,
+    cloned: TreeNode | null,
+    target: TreeNode | null,
+): TreeNode | null {
+    if (cloned === null) {
+        return null;
+    }
+    if (cloned.val === target.val) {
+        return cloned;
+    }
+    return (
+        getTargetCopy(original, cloned.left, target) ||
+        getTargetCopy(original, cloned.right, target)
+    );
+}