#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
class LinkNode{
public:
int data;
LinkNode* next;
LinkNode(int d=0, LinkNode* n = 0){
data = d;
next = n;
}
};
class Link{
public:
LinkNode* create();
void list(LinkNode* pHead);
LinkNode* search(LinkNode* pHead);
LinkNode* erase(LinkNode* pHead);
LinkNode* hebing(LinkNode* pHead1, LinkNode*pHead2);
LinkNode* hebing1(LinkNode* pHead1, LinkNode* pHead2);
};
LinkNode* Link::create(){
LinkNode *pHead=0, *pTemp, *pTail=0;
int data;
cout << "輸入數據(data<0結束)\n";
cin >> data;
while (data > 0){
pTemp = new LinkNode;
pTemp->data = data;
pTemp->next = 0;
if (!pHead){ //頭結點,非零爲一
pHead = pTail = pTemp;
}
else{
//新增結點在後面
pTail->next = pTemp; //當前節點的指針域指向下一個結點
pTail = pTemp; //尾指針指向最後結點
//新增結點在最前面
//pTemp->next = pHead; //新節點的指針域指向首結點
//pHead = pTemp; //頭指針指向新的首結點
}
//cout << "輸入數據\n";
cin >> data;
}
return pHead;
}
void Link::list(LinkNode* pHead){
while (pHead){
cout << pHead->data << " ";
pHead = pHead->next; //關鍵
}
cout << "\n";
}
LinkNode* Link:: search(LinkNode* pHead){
int m;
cout << "按照數據查找輸入1,按照編號查找輸入2\n";
cin >> m;
switch (m)
{
case 1:{
int data;
cout << "請輸入查找的數據\n";
cin >> data;
while (pHead){
if (pHead->data == data)
break;
pHead = pHead->next;
}
break;
}case 2:{
int n;
cout << "請輸入查找的編號(第一個編號爲1)\n";
cin >> n;
for (int i = 0; i < n - 1; i++){
pHead = pHead->next;
if (!pHead)
break; //已經到最後了,則跳出
}
break;
}
default:
break;
}
return pHead;
}
LinkNode* Link::erase(LinkNode* pHead){
LinkNode *p, *q;
cout << "先查找後刪除\n";
p = search(pHead);
if (p)
cout << "數據存在\n";
else {
cout << "數據不存在\n";
return pHead;
}
q = pHead;
if (p == pHead){ //刪除第一個結點
pHead = pHead->next;
delete p;
return pHead;
}
while ((q != NULL) && (q->next) != p)
q = q->next;
//向後移動q,直到q在p前一個.
q->next = p->next;
delete p;
return pHead;
}
LinkNode* Link::hebing(LinkNode* pHead1, LinkNode*pHead2){
LinkNode *head = new LinkNode; //新建一個結點
LinkNode *temp = head;
while ((pHead1 != NULL) && (pHead2 != NULL)){
if ((pHead1->data) < (pHead2->data)){
temp->next = pHead1;
pHead1 = pHead1->next;
}
else
{
temp->next = pHead2;
pHead2 = pHead2->next;
}
temp = temp->next;
}
//其中一個鏈表剩下最後一個結點
if (pHead1 != NULL) //pHead1指向最後一個,pHead2指向NUll。
temp->next = pHead1;
if (pHead2 != NULL) //曾經出現bug,寫成pHead2->next;
temp->next = pHead2;
return head->next; //不是head,是原先的第一個結點.
//參考ttp://wiki.jikexueyuan.com/project/for-offer/question-senenteen.html
}
LinkNode* Link::hebing1(LinkNode* pHead1, LinkNode *pHead2){
LinkNode *pTemp1 = pHead1, *pTemp2 = pHead2;
while ((pTemp2->next) != 0){ //bug所在,pTemp2 != 0,出錯
if ((pTemp2->data) >= (pTemp1->data) && (pTemp2->data) <= (pTemp1->next->data)){
LinkNode* temp = pTemp2->next;
pTemp2->next = pTemp1->next;
pTemp1->next = pTemp2;
pTemp1 = pTemp1->next->next;
pTemp2 = temp;
}
else
pTemp2 = pTemp2->next;
}
pTemp1->next = pTemp2; //bug所在。否則沒有最後一個。
return pHead1;
}
int main(){
Link Link1;
cout << "創建第一個鏈表\n";
LinkNode *pHead, *pResualt = 0;
pHead = Link1.create();
cout << "遍歷鏈表\n";
//cout << "查找:\n";
Link1.list(pHead);
cout << "查找\n";
pResualt = Link1.search(pHead);
if (pResualt)
cout << "查找的數據 " << pResualt->data << endl;
else
cout << "not found!\n";
cout << "刪除\n";
pHead = Link1.erase(pHead);
cout << "新鏈表\n";
Link1.list(pHead);
cout << "合併兩個有序鏈表(生成新鏈表)\n";
LinkNode *pHead1, *pHead2;
cout << "第一個有序鏈表\n";
pHead1 = Link1.create();
cout << "第二個有序鏈表\n";
pHead2 = Link1.create();
LinkNode* pResualt1;
pResualt1 = Link1.hebing(pHead1, pHead2);
Link1.list(pResualt1);
cout << "合併成一個有序鏈表\n";
LinkNode *pHead11, *pHead21;
cout << "第一個有序鏈表\n";
pHead11 = Link1.create();
cout << "第二個有序鏈表\n";
pHead21 = Link1.create();
LinkNode* pResualt2;
pResualt2 = Link1.hebing1(pHead11, pHead21);
Link1.list(pResualt2);
return 0;
}
/*鏈表習題
所有習題要求基於帶頭結點的鏈表完成,並採用類來實現; 每個操作定義函數實現
基本題目
1. 建立鏈表(數據域只有一個整型)
(1) 每次新增結點放在最前面
(2) 每次新增結點放在最後面
(3) 每次新增結點有序插入
2. 遍歷鏈表
輸出鏈表節點數據,核心語句 p = p->next
3. 查找結點
(1)按照編號查找,即查找第幾個節點
(2)按照數據查找
4. 刪除結點
(1)按照編號刪除,即刪除第幾個
(2)按照數據查找並刪除
5. 對有序鏈表合併
(1)合併後生成新鏈表
(2)合併後不生成新的鏈表(a 、b合併結果在a中)*/
小學期鏈表作業
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.