3.10
13.將一個單向鏈表連接到另一個單向鏈表的末尾。
void List_addlist(List la, List lb) {
List pa, pb;
pa = la->next;
pb = lb->next;
int n;
n = List_length(la);
for (int i = 1; i < n; i++)
{
pa = pa->next;
}
pa->next = pb;
}
3.10
13.將一個單向鏈表連接到另一個單向鏈表的末尾。
void List_addlist(List la, List lb) {
List pa, pb;
pa = la->next;
pb = lb->next;
int n;
n = List_length(la);
for (int i = 1; i < n; i++)
{
pa = pa->next;
}
pa->next = pb;
}