add 1669

fishercoder1534 · fishercoder1534 · commit ddb366bb4056 · 2020-11-28T11:24:32.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1669|[Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1669.java) ||Medium|LinedList|
 |1668|[Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1668.java) ||Easy|String|
 |1664|[Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/)|[Javascript](./javascript/_1664.js) ||Medium|Greedy|
 |1663|[Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1663.java) ||Medium|Greedy|
diff --git a/src/main/java/com/fishercoder/solutions/_1669.java b/src/main/java/com/fishercoder/solutions/_1669.java
@@ -0,0 +1,36 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.ListNode;
+
+public class _1669 {
+    public static class Solution1 {
+        public ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2) {
+            ListNode pre = new ListNode(-1);
+            ListNode list1Temp = list1;
+            pre.next = list1Temp;
+            b -= a;
+            while (a > 1) {
+                list1Temp = list1Temp.next;
+                a--;
+            }
+            ListNode tail = list1Temp.next;
+            list1Temp.next = list2;
+            while (b > 0) {
+                tail = tail.next;
+                b--;
+            }
+            int length = 0;
+            ListNode temp2 = list2;
+            while (temp2 != null) {
+                temp2 = temp2.next;
+                length++;
+            }
+            while (length > 0) {
+                list1Temp = list1Temp.next;
+                length--;
+            }
+            list1Temp.next = tail.next;
+            return pre.next;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1669Test.java b/src/test/java/com/fishercoder/_1669Test.java
@@ -0,0 +1,35 @@
+package com.fishercoder;
+
+import com.fishercoder.common.classes.ListNode;
+import com.fishercoder.common.utils.LinkedListUtils;
+import com.fishercoder.solutions._1;
+import com.fishercoder.solutions._1669;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+import static org.junit.Assert.assertEquals;
+
+public class _1669Test {
+    private static _1669.Solution1 solution1;
+    private static ListNode list1;
+    private static ListNode list2;
+    private static ListNode expected;
+    private static ListNode actual;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1669.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        list1 = LinkedListUtils.contructLinkedList(new int[]{0, 1, 2, 3, 4, 5});
+        list2 = LinkedListUtils.contructLinkedList(new int[]{1000000, 1000001, 1000002});
+        expected = LinkedListUtils.contructLinkedList(new int[]{0, 1, 2, 1000000, 1000001, 1000002, 5});
+        actual = solution1.mergeInBetween(list1, 3, 4, list2);
+        LinkedListUtils.printList(actual);
+        assertEquals(expected, actual);
+    }
+
+}
