代碼塊
//錯(cuò)誤點(diǎn)1：在輸出鏈表信息的時(shí)候沒(méi)有加 p =p->pNext;這句話(huà)，導(dǎo)致運(yùn)行出現(xiàn)問(wèn)題
//問(wèn)題2：結(jié)構(gòu)體取名確實(shí)叫LNode比較好插勤，自己取名SList有點(diǎn)說(shuō)不過(guò)去
//下面還有一些自己看并沒(méi)有動(dòng)手實(shí)驗(yàn)的時(shí)候，沒(méi)有認(rèn)真想的地方糠排，然后自己試驗(yàn)過(guò)程中需要花費(fèi)一點(diǎn)時(shí)間傍衡，考慮其中的關(guān)系，在這個(gè)地方区匠，真心不應(yīng)該的
typedef struct LNode
{
int nData;
struct LNode* pNext;
}LNode;

void InitListData(LNode *&p)
{
p = (LNode *)malloc(sizeof(LNode));
p->pNext = NULL;
}

void CreateSingleList(LNode &pList,int nNum[],int n)
{
LNode p = pList;
LNode* q;
for (int i=0; i<n; i++)
{
InitListData(q);
q->nData = nNum[i];
p->pNext = q;
p = p->pNext;
}
}

void ShowList(LNode* p)
{
cout<<"輸出鏈表："<<endl;
while (NULL!=p->pNext)
{
cout<<p->pNext->nData<<endl;
p =p->pNext;
}
cout<<"鏈表輸出結(jié)束"<<endl;
}

//頭插法干像，從大到小排序
void MergeListFromBToL(LNode* &pHead1,LNode* &pHead2,LNode* &pMergeHead)
{
LNode* p1 = pHead1->pNext;
LNode* p2 = pHead2->pNext;
pMergeHead = pHead1;
pMergeHead->pNext = NULL;
LNode* p;
free(pHead2);
while (p1!=NULL && p2!=NULL)
{
if (p1->nData<p2->nData)
{
p = p1->pNext;//這個(gè)地方想了一分鐘才捋順關(guān)系，不應(yīng)該的
p1->pNext=pMergeHead->pNext;
pMergeHead->pNext = p1;
p1 = p;
}
else
{
p = p2->pNext;
p2->pNext = pMergeHead->pNext;
pMergeHead->pNext = p2;
p2 = p;
}
}
while(p1!=NULL)
{
p = p1->pNext;
p1->pNext=pMergeHead->pNext;
pMergeHead->pNext = p1;
p1 = p;
}
while(p2!=NULL)
{
p = p2->pNext;
p2->pNext = pMergeHead->pNext;
pMergeHead->pNext = p2;
p2 = p;
}
}

//尾插法驰弄，從小到大排序
void MergeList(LNode* &pHead1,LNode* &pHead2,LNode* &pMergeHead)
{
LNode* p1 = pHead1->pNext;
LNode* p2 = pHead2->pNext;
LNode* p = pMergeHead;
pMergeHead = pHead1;//這個(gè)地方寫(xiě)的時(shí)候出現(xiàn)了錯(cuò)誤麻汰，寫(xiě)的是=p1；
free(pHead2);//以前這個(gè)地方?jīng)]有特別注意戚篙，確實(shí)合并之后五鲫，這個(gè)頭結(jié)點(diǎn)已經(jīng)不需要，需要及時(shí)的釋放掉
while (p1!=NULL && p2!=NULL)
{
if (p1->nData<p2->nData)
{
p->pNext = p1;
p = p->pNext;
p1 = p1->pNext;

    }
    else
    {
        p->pNext = p2;
        p = p->pNext;
        p2 = p2->pNext;
    }
}
if (p1 != NULL)
{
    p->pNext = p1;
}
else
{
    p->pNext = p2;
}

}

void FindAndDelete(LNode& pHead,int nData)
{
LNode p = pHead->pNext;
LNode* q = pHead;
while (q!=NULL && p!=NULL)
{
if (p->nData == nData)
{
q->pNext = p->pNext;
free(p);
break;
}
p = p->pNext;
q = q->pNext;
}
}
int _tmain(int argc, _TCHAR* argv[])
{
int nListNum[5] = {0,1,2,3,4};
int listNum[5] = {1,3,4,5,6};
LNode* pHeadList1;
LNode* pHeadList2;
LNode* pMergeHead;
InitListData(pHeadList1);
InitListData(pHeadList2);
InitListData(pMergeHead);
CreateSingleList(pHeadList1,nListNum,5);
CreateSingleList(pHeadList2,listNum,5);
// ShowList(pHeadList1);
// ShowList(pHeadList2);
MergeListFromBToL(pHeadList1,pHeadList2,pMergeHead);
ShowList(pMergeHead);
return 0;
}