64,649
社区成员
发帖
与我相关
我的任务
分享
Node* merge(Node* list1, Node* list2) {
Node* merged = null;
Node** tail = &merged;
while (list1 && list2) {
if (list1->data < list2->data) {
*tail = list1;
list1 = list1->next;
} else {
*tail = list2;
list2 = list2->next;
}
tail = &((*tail)->next);
}
*tail = list1 ? list1 : list2;
return merged;
}
int main()
{
int *p=NULL;
int **q=NULL;
int a=5;
p=&a;
q=&p;
cout<<a<<" "<<*p<<" "<<**q<<endl;
return 0;
}