Leetcode链表4

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* mergeInBetween(struct ListNode* list1, int a, int b, struct ListNode* list2){
    struct ListNode *fast = list1;
    struct ListNode *slow =  list1;
    struct ListNode *temp = list2;
    for(int i =0;i<b+1;i++)
    {
        fast = fast->next;
    }
    for(int i = 0;i<a-1;i++)
    {
        slow = slow->next;
    }
    slow->next = list2;
    
    while((temp !=NULL) && (temp->next != NULL))
    {
        temp = temp->next;
    }
    temp->next = fast;
    return list1;
}