两个有序单链表归并为一个有序单链表(c实现)

来源:互联网 发布:热血封神翅膀进阶数据 编辑:程序博客网 时间:2024/05/29 04:32

两个有序单链表归并为一个有序单链表

c代码:

//定义节点struct ListNode{    int m_nValue;    ListNode* m_pNext; } ; ListNode* Merge(ListNode* pHead1,ListNode* pHead2) {    if(pHead1 == NULL)    return pHead2;    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; } 
1 0
原创粉丝点击