feat: add typescript solution to lc problem: No.0160.Intersection of Two Linked Lists (doocs#440)

Author: zhaocchen

solution/0100-0199/0160.Intersection of Two Linked Lists/README.md

@@ -200,6 +200,31 @@ public:
 }
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+function getIntersectionNode(headA: ListNode | null, headB: ListNode | null): ListNode | null {
+    let p1: ListNode | null = headA;
+    let p2: ListNode | null = headB;
+    while (p1 != p2) {
+        p1 = p1 == null ? headB : p1.next;
+        p2 = p2 == null ? headA : p2.next;
+    }
+    return p1;
+};
+```
 ### **...**
 
 ```

solution/0100-0199/0160.Intersection of Two Linked Lists/README_EN.md

@@ -185,6 +185,31 @@ public:
 }
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+function getIntersectionNode(headA: ListNode | null, headB: ListNode | null): ListNode | null {
+    let p1: ListNode | null = headA;
+    let p2: ListNode | null = headB;
+    while (p1 != p2) {
+        p1 = p1 == null ? headB : p1.next;
+        p2 = p2 == null ? headA : p2.next;
+    }
+    return p1;
+};
+```
 ### **...**
 
 ```

solution/0100-0199/0160.Intersection of Two Linked Lists/Solution.ts

@@ -0,0 +1,21 @@
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+ function getIntersectionNode(headA: ListNode | null, headB: ListNode | null): ListNode | null {
+    let p1: ListNode | null = headA;
+    let p2: ListNode | null = headB;
+    while (p1 != p2) {
+        p1 = p1 == null ? headB : p1.next;
+        p2 = p2 == null ? headA : p2.next;
+    }
+    return p1;
+};