合并两个已序单链表-创新互联

// 合并两个已序单链表

PSListNode MergeList(PSListNode pL1, PSListNode pL2)

{

                PSListNode pNewHead = NULL ;

                PSListNode pL1Node = pL1 ;

                PSListNode pL2N0de = pL2 ;

                PSListNode pNode = NULL ;

                PSListNode pTailNode = NULL ;

                if (pL1 == NULL)

               {

                                return pL2 ;

               }

                if (pL2 == NULL)

               {

                                return pL1 ;

               }

                if (pL1Node->data > pL2N0de->data)

               {

                               pNode = pL2N0de;

                               pL2N0de = pL2N0de->pNext;

               }

                else

               {

                               pNode = pL1Node;

                               pL1Node = pL1Node->pNext;

               }

               pNewHead = pNode;

               pTailNode = pNode;

                while (pL1Node&&pL2N0de)

               {

                                if (pL1Node->data > pL2N0de->data)

                               {

                                               pNode = pL2N0de;

                                               pL2N0de = pL2N0de->pNext;

                               }

                                else

                               {

                                               pNode = pL1Node;

                                               pL1Node = pL1Node->pNext;

                               }

                               pTailNode->pNext = pNode;

                               pTailNode = pTailNode->pNext;

               }

                if (pL1Node == NULL )

               {

                               pTailNode->pNext = pL2N0de;

               }

                else

               {

                               pTailNode->pNext = pL1Node;

               }

                return pNewHead;

}

void Print(PSListNode pHead)

{

                PSListNode pCurNode = pHead ;

                while (pCurNode)

               {

                               printf( "%d->", pCurNode->data);

                               pCurNode = pCurNode->pNext;

               }

               printf( "NULL\n");

}

创新互联www.cdcxhl.cn，专业提供香港、美国云服务器，动态BGP最优骨干路由自动选择，持续稳定高效的网络助力业务部署。公司持有工信部办法的idc、isp许可证， 机房独有T级流量清洗系统配攻击溯源，准确进行流量调度，确保服务器高可用性。佳节活动现已开启，新人活动云服务器买多久送多久。