Interview question 17: Merge two sorted lists

Title Description

Enter two incrementally sorted lists, merge the two linked lists, and make the nodes in the new list continue to be sorted in ascending order. For example, in Figure 3.7, linked list 1 and linked List 2, the merged ascending chain list as shown in List 3. The linked list node is defined as follows:

Problem analysis

Sword means offer (Commemorative edition) P114

Code implementation

listnode* Merge (listnode* pHead1, listnode* pHead2) {    if (pHead1 = = NULL)        return pHead2;    else if (pHead2 = = NULL)        return pHead1;    listnode* pmergedhead = NULL;    if (Phead1->m_nvalue < Phead2->m_nvalue)    {        pmergedhead = pHead1;        Pmergedhead->m_pnext = Merge (Phead1->m_pnext, pHead2);    }    else    {        pmergedhead = pHead2;        Pmergedhead->m_pnext = Merge (PHead1, Phead2->m_pnext);    }    return pmergedhead;}

　　

Interview question 17: Merge two sorted lists