1669. 合并两个链表

nuita

于 2023-01-30 16:12:42 发布

阅读量187

点赞数

CC 4.0 BY-SA版权

文章标签：链表数据结构

本文链接：https://blog.youkuaiyun.com/qq_25155231/article/details/128804541

class Solution {
public:
    ListNode* mergeInBetween(ListNode* list1, int a, int b, ListNode* list2) {
        ListNode* ans = list1, * list2_head = list2;
        while (list2->next != NULL)list2 = list2->next;
        for (int i = 0; i <= b; i++) {
            if (i == a - 1) {
                ListNode* p = list1;
                list1 = list1->next;
                p->next = list2_head;
                continue;
            }
            list1 = list1->next;
        }
        list2->next = list1;
        return ans;
    }
};