feat: add solutions to lc problem: No.1669. Merge In Between Linked Lists

Author: yanglbme

solution/1600-1699/1669.Merge In Between Linked Lists/README.md

@@ -44,7 +44,6 @@
 	<li><code>1 <= list2.length <= 10<sup>4</sup></code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -56,15 +55,58 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def mergeInBetween(self, list1: ListNode, a: int, b: int, list2: ListNode) -> ListNode:
+        p = q = list1
+        for _ in range(a - 1):
+            p = p.next
+        for _ in range(b + 1):
+            q = q.next
+        p.next = list2
+        while list2.next:
+            list2 = list2.next
+        list2.next = q
+        return list1
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2) {
+        ListNode p = list1;
+        for (int i = 0; i < a - 1; ++i) {
+            p = p.next;
+        }
+        ListNode q = list1;
+        for (int i = 0; i < b + 1; ++i) {
+            q = q.next;
+        }
+        p.next = list2;
+        while (list2.next != null) {
+            list2 = list2.next;
+        }
+        list2.next = q;
+        return list1;
+    }
+}
 ```
 
 ### **...**

solution/1600-1699/1669.Merge In Between Linked Lists/README_EN.md

@@ -38,21 +38,63 @@
 	<li><code>1 &lt;= list2.length &lt;= 10<sup>4</sup></code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def mergeInBetween(self, list1: ListNode, a: int, b: int, list2: ListNode) -> ListNode:
+        p = q = list1
+        for _ in range(a - 1):
+            p = p.next
+        for _ in range(b + 1):
+            q = q.next
+        p.next = list2
+        while list2.next:
+            list2 = list2.next
+        list2.next = q
+        return list1
 ```
 
 ### **Java**
 
 ```java
-
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2) {
+        ListNode p = list1;
+        for (int i = 0; i < a - 1; ++i) {
+            p = p.next;
+        }
+        ListNode q = list1;
+        for (int i = 0; i < b + 1; ++i) {
+            q = q.next;
+        }
+        p.next = list2;
+        while (list2.next != null) {
+            list2 = list2.next;
+        }
+        list2.next = q;
+        return list1;
+    }
+}
 ```
 
 ### **...**

solution/1600-1699/1669.Merge In Between Linked Lists/Solution.java

@@ -0,0 +1,28 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2) {
+        ListNode p = list1;
+        for (int i = 0; i < a - 1; ++i) {
+            p = p.next;
+        }
+        ListNode q = list1;
+        for (int i = 0; i < b + 1; ++i) {
+            q = q.next;
+        }
+        p.next = list2;
+        while (list2.next != null) {
+            list2 = list2.next;
+        }
+        list2.next = q;
+        return list1;
+    }
+}

solution/1600-1699/1669.Merge In Between Linked Lists/Solution.py

@@ -0,0 +1,17 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def mergeInBetween(self, list1: ListNode, a: int, b: int, list2: ListNode) -> ListNode:
+        p = q = list1
+        for _ in range(a - 1):
+            p = p.next
+        for _ in range(b + 1):
+            q = q.next
+        p.next = list2
+        while list2.next:
+            list2 = list2.next
+        list2.next = q
+        return list1