1、记着怎么定义这样的结构体。
typedef struct node{
int data;
struct node *next;
}node, *List;
2、到哪儿都注意,防止指针为空、防止链表为空。
List merge(List l1, List l2){
node *p3;
List l3=NULL;
if(l1==NULL)
return l2;
if(l2==NULL)
return l1;
if(l1->data > l2->data)
{
l3 = l2;
l2 = l2->next;
}
else
{
l3 = l1;
l1 = l1->next;
}
p3 = l3;
while(l1 && l2)
{
if(l1->data > l2->data)
{
p3->next = l2;
l2 = l2->next;
}
else
{
p3->next = l1;
l1 = l1->next;
}
p3 = p3->next;
}
if(l1==NULL)
p3->next = l2;
else
p3->next = l1;
return l3;
}
该问题同时也是leetcode上的一道题。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
if(l1 == NULL)
return l2;
if(l2 == NULL)
return l1;
ListNode *newlist;
if(l1->val < l2->val)
{
newlist = l1;
l1 = l1->next;
}
else
{
newlist = l2;
l2 = l2->next;
}
ListNode *p = newlist;
while(l1!=NULL && l2!=NULL)
{
if(l1->val < l2->val)
{
p->next = l1;
p = p->next;
l1 = l1->next;
}
else
{
p->next = l2;
p = p->next;
l2 = l2->next;
}
}
if(l1 == NULL)
p->next = l2;
else
p->next = l1;
return newlist;
}
};
添加一个临时的空头结点可以使得合并操作变得一致。
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
if(l1 == NULL)
return l2;
if(l2 == NULL)
return l1;
ListNode tmp(0);
ListNode *p = &tmp;
while(l1 != NULL && l2 != NULL)
{
if(l1->val < l2->val)
{
p->next = l1;
l1 = l1->next;
}
else
{
p->next = l2;
l2 = l2->next;
}
p = p->next;
}
if(l1 == NULL)
p->next = l2;
else
p->next = l1;
return tmp.next;
}
};