合并俩个排序的链表

typedef struct node
{
struct node* next;

int data;

}ListNode;

ListNode* MerageList(ListNode* one, ListNode* two)
{
if (one == NULL)
{
return  two;
}

if (two == NULL)
{
return  one;
}

ListNode * head;

ListNode *node  = head;

while (one != NULL && two != NULL)
{
if (one->data < two->data)
{
node->next = one;

one = one->next;
}
else
{
node->next = two;

two= two ->next;
}

node = node->next;

}

if (two != NULL)
{
node->next = two;
}

if(one != NULL)
{
node->next = one;
}

return head;

}