add 2095

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2095|[Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2095.java) ||Medium||
 |2094|[Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2094.java) ||Easy||
 |2091|[Removing Minimum and Maximum From Array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2091.java) ||Medium||
 |2090|[K Radius Subarray Averages](https://leetcode.com/problems/k-radius-subarray-averages/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2090.java) ||Medium||

src/main/java/com/fishercoder/solutions/_2095.java

@@ -0,0 +1,27 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.ListNode;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _2095 {
+    public static class Solution1 {
+        public ListNode deleteMiddle(ListNode head) {
+            List<Integer> list = new ArrayList<>();
+            while (head != null) {
+                list.add(head.val);
+                head = head.next;
+            }
+            ListNode pre = new ListNode(-1);
+            ListNode tmp = pre;
+            for (int i = 0; i < list.size(); i++) {
+                if (i != list.size() / 2) {
+                    tmp.next = new ListNode(list.get(i));
+                    tmp = tmp.next;
+                }
+            }
+            return pre.next;
+        }
+    }
+}