Re: [閒聊] 每日leetcode
直接找到那兩個點塞進去
好暴力
好爽
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;
}
};
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 134.208.57.64 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1710909835.A.3EE.html
→
03/20 12:59,
1月前
, 1F
03/20 12:59, 1F
→
03/20 13:00,
1月前
, 2F
03/20 13:00, 2F
討論串 (同標題文章)