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

No.2095.Delete the Middle Node of a Linked List

Author: zhaocchen

Diff for: solution/2000-2099/2095.Delete the Middle Node of a Linked List/README.md

@@ -123,7 +123,28 @@ class Solution {
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```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 deleteMiddle(head: ListNode | null): ListNode | null {
+    if (!head || !head.next) return null;
+    let fast = head.next, slow = head;
+    while (fast.next && fast.next.next) {
+        slow = slow.next;
+        fast = fast.next.next;
+    }
+    slow.next = slow.next.next;
+    return head;
+};
 ```
 
 ### **...**

Diff for: solution/2000-2099/2095.Delete the Middle Node of a Linked List/README_EN.md

@@ -106,7 +106,28 @@ class Solution {
 ### **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 deleteMiddle(head: ListNode | null): ListNode | null {
+    if (!head || !head.next) return null;
+    let fast = head.next, slow = head;
+    while (fast.next && fast.next.next) {
+        slow = slow.next;
+        fast = fast.next.next;
+    }
+    slow.next = slow.next.next;
+    return head;
+};
 ```
 
 ### **...**

Diff for: solution/2000-2099/2095.Delete the Middle Node of a Linked List/Solution.ts

@@ -0,0 +1,22 @@
+/**
+ * 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 deleteMiddle(head: ListNode | null): ListNode | null {
+    if (!head || !head.next) return null;
+    let fast = head.next, slow = head;
+    while (fast.next && fast.next.next) {
+        slow = slow.next;
+        fast = fast.next.next;
+    }
+    slow.next = slow.next.next;
+    return head;
+};