鏈表結(jié)點(diǎn)的定義:
struct ListNode
{
int m_nKey;
ListNode* m_pNext;
};
1碰声、單鏈表的創(chuàng)建
注意要創(chuàng)建頭結(jié)點(diǎn)
ListNode create(int data,int len)//data[]輸入的數(shù)組诡蜓,len是輸入數(shù)組長度
{
ListNode head,p,q;//定義三個結(jié)點(diǎn),首胰挑、中蔓罚、尾
//head=(ListNode)malloc(sizeof(ListNode));
head=new ListNode;//創(chuàng)建頭節(jié)點(diǎn)
int i;
for(i=0;i<len;i++)
{
//p=(ListNode*)malloc(sizeof(ListNode));
p= new ListNode;//每次插入一個,就新建一個結(jié)點(diǎn)
p->m_nKey=data[i];
if(i==0)
{
head->m_pNext=p;//頭結(jié)點(diǎn)
}
else
{
q->m_pNext=p;
}
q=p;
}
q->m_pNext=NULL;//鏈表最后一個指針為NULL
return head;
}
2瞻颂、鏈表打印
void print_ListNode(ListNode *head)
{
ListNode *p;
if(head->m_pNext==NULL)
{
cout<<"鏈表為空"<<endl;
return;
}
p=head->m_pNext;
while(p!=NULL)
{
cout<<p->m_nKey<<" ";
p=p->m_pNext;
}
cout<<endl;
}
3豺谈、鏈表結(jié)點(diǎn)的刪除
要找到刪除結(jié)點(diǎn)前一結(jié)點(diǎn)的位置。從表頭開始遍歷贡这,發(fā)現(xiàn)結(jié)點(diǎn)p的m_pNext指向要刪除的結(jié)點(diǎn)i茬末,于是我們可以把結(jié)點(diǎn)p的m_pNext指向i的下一個結(jié)點(diǎn)。指針調(diào)整后盖矫,就可以安全地刪除結(jié)點(diǎn)i并保證鏈表沒有斷開丽惭。
ListNode delete_node(ListNode pListHead, int k)//要刪除k,需要找到k值前一個節(jié)點(diǎn)
{
if(pListHead==NULL)
return NULL;
ListNode *p1=NULL;
ListNode *p2=NULL;
p1=pListHead;
if(p1->m_pNext->m_nKey==k)//刪除的結(jié)點(diǎn)是第一個節(jié)點(diǎn)
{
p2=p1->m_pNext;
pListHead->m_pNext=p2->m_pNext;
delete p2;
return pListHead;
}
else //刪除的結(jié)點(diǎn)是第一個節(jié)點(diǎn)
{
while(p1->m_pNext!=NULL)
{
if(p1->m_pNext->m_nKey==k)
{
p2=p1->m_pNext;
p1->m_pNext=p2->m_pNext;
delete p2;
}
else
{
p1=p1->m_pNext;
}
}
}
return pListHead;
}
主函數(shù)如下:#include<stdio.h>
include<iostream>
include<vector>
include<map>
include<algorithm>
using namespace std;
struct ListNode
{
int m_nKey;
ListNode* m_pNext;
};
ListNode *create(int *data,int len);
ListNode FindKthToTail(ListNode pListHead, int k);
void print_ListNode(ListNode *head) ;
int main()
{
int num,n;
while(cin>>num)
{
cout<<"輸入"<<num<<"個整數(shù):"<<endl;
int *data=new int[num];
for(int i=0;i<num;i++)
{
cin>>data[i];
}
ListNode head,p;
head=create(data,num);
cout<<"創(chuàng)建的鏈表為:"<<endl;
print_ListNode(head);
cout<<"輸入刪除的結(jié)點(diǎn):"<<endl;
cin>>n;
p=delete_node(head,n);
cout<<"輸入刪除的結(jié)點(diǎn)后鏈表為:"<<endl;
print_ListNode(p);
}
return 0;
}