题目地址:
https://leetcode.com/problems/merge-in-between-linked-lists/
给定两个链表 l 1 l_1 l1和 l 2 l_2 l2,要求将 l 1 l_1 l1的下标为 a ∼ b a\sim b a∼b的节点删除,并且将 l 2 l_2 l2插在中间。返回新链表头。题目保证 a a a和 b b b下标都合法。
先找到 l 1 l_1 l1下标为 a − 1 a-1 a−1的节点,然后找到下标为 b + 1 b+1 b+1的节点,接着将 l 2 l_2 l2接到 a − 1 a-1 a−1节点后面,再找到 l 2 l_2 l2的尾节点,连到 b + 1 b+1 b+1节点前面。代码如下:
public class Solution {
public ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2) {
ListNode dummy = new ListNode(0), prev = dummy;
dummy.next = list1;
for (int i = 0; i < a; i++) {
prev = prev.next;
}
ListNode next = prev;
for (int i = 0; i < b - a + 2; i++) {
next = next.next;
}
prev.next = list2;
while (prev.next != null) {
prev = prev.next;
}
prev.next = next;
return dummy.next;
}
}
class ListNode {
int val;
ListNode next;
public ListNode(int val) {
this.val = val;
}
}
时间复杂度 O ( l 1 + l 2 ) O(l_1+l_2) O(l1+l2),即两个链表长度之和,空间 O ( 1 ) O(1) O(1)。