資源簡介
單鏈表詳細操作:"1:創建單鏈表"
"2:輸出單鏈表中的元素"
"3:按值查找元素"
"4:按位置查找元素"
"5:插入元素到單鏈表里"
"6:刪除鏈表中的某個結點"
"7.退出"
代碼片段和文件信息
#include?
#include?
#include?
using?namespace?std;
#define?OK?1
#define?ERROR?0
#define?OVERFLOW?-2
typedef?int?ListData;
typedef?int?Status;
typedef?struct?LNode?{??????????//鏈表結點
???ListData??data; ??????????????????//結點數據域
???struct?LNode??*?next;???????????//結點鏈域
}?ListNode;
typedef?ListNode??*?linkList;???//鏈表頭指針
linkList??first;??????????????????????//鏈表頭指針
//建立鏈表
void?CreateList_L(linkList?&L?int?n){
????L?=?(linkList)malloc(sizeof(LNode));?//?產生頭結點并使L指向此頭結點
????cout?<“依次輸入鏈表元素:“;
????linkList?pq;
????L->next=NULL;
????p=L;????????//初始化鏈表
????for(int?i=0x;i ????????linkList?q=new?LNode;
????????cin>>x;
????????q->data=x;
????????p->next=q;
????????p=p->next;
????}
????p->next=NULL;
}
Status
評論
共有 條評論