直接上代码
NODE combine(NODE L1,NODE L2)
{
NODE r;
NODE p1 = L1->next;
NODE p2 = L2->next;
NODE C = (NODE)malloc(sizeof(lnode)); //L1->next = NULL;
NODE M = C;
M->next = NULL;
while( p1!=NULL && p2!=NULL)
{
if(p1->data < p2->data)
{
r = p1;
p1 = p1->next;
}
else if(p1->data >