Re: [閒聊] 每日leetcode

作者: oin1104 (是oin的說)   2024-03-20 12:43:53
直接找到那兩個點塞進去
好暴力
好爽
class Solution {
public:
ListNode* mergeInBetween(ListNode* list1, int a, int b, ListNode* list2)
{
ListNode* pa = list1;
ListNode* pb = list1;
for(int i = 1 ; i < a ; i ++)
{
pa = pa->next;
}
for(int i = 0 ; i <= b ; i ++)
{
pb = pb->next;
}
pa->next = list2;
while(list2->next)
{
list2 = list2->next;
}
list2->next = pb;
return list1;
}
};
作者: NCKUEECS (小惠我婆)   2024-03-20 12:59:00
好色喔
作者: digua (地瓜)   2024-03-20 13:00:00
大師

Links booklink

Contact Us: admin [ a t ] ucptt.com