add 2130

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2130|[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2130.java) ||Medium||
 |2129|[Capitalize the Title](https://leetcode.com/problems/capitalize-the-title/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2129.java) ||Easy||
 |2126|[Destroying Asteroids](https://leetcode.com/problems/destroying-asteroids/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2126.java) ||Medium||
 |2125|[Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2125.java) ||Medium||

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

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