最近打算複習鞏固一下數據結構，用c++實現了鏈表的一些基本功能，可能有bug，有問題的話，希望大佬留下評論指證。
#include <iostream>
#include <malloc.h>
#include <ctime>
#include <cmath>
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
using namespace std;
typedef int ElmeType;
typedef int status;
//鏈表的結構體
typedef struct Node
{
ElmeType data;
struct Node* next;
} Node;
typedef struct Node* LinkList;
//初始化鏈表
status InitList(LinkList *L)
{
*L = (LinkList)malloc(sizeof(Node));
if((*L))
return ERROR;
(*L)->next = NULL;
return OK;
}
//頭插法創建鏈表
status CreateListHead(LinkList *L, int len)
{
LinkList p;
srand(time(0));//初始化隨機數種子
*L = (LinkList)malloc(sizeof(Node));//創建一個頭節點
(*L)->next = NULL;
for(int i = 0; i < len; i++)
{
p = (LinkList)malloc(sizeof(Node));//創建新的節點
p->data = rand() % 100 + 1;
p->next = (*L)->next;
(*L)->next = p;
}
return OK;
}
//尾插法創建鏈表
status CreateListTail(LinkList *L, int len)
{
LinkList p, q;
srand(time(0));//初始化隨機數種子
*L = (LinkList)malloc(sizeof(Node));
//p = (LinkList)malloc(sizeof(Node));
//p->data = rand()%100 + 1;
//(*L)->next = p;
p = *L;
for( int i = 0; i < len; i++)
{
q = (LinkList)malloc(sizeof(Node));
q->data = rand() % 100 + 1;
p ->next = q;
p = p->next;
p->next = NULL;
}
return OK;
}
//刪除鏈表
void DeleteList(LinkList *L)
{
LinkList p, q;
p = (*L)->next;
while(p)
{
q = p->next;
delete(p);
p = q;
}
(*L)->next = NULL;
}
//打印出鏈表內容
void PrintLinkList(LinkList L)
{
LinkList p;
p = L->next;
while(p)
{
cout << p->data << "\t";
p = p->next;
}
cout << endl;
}
//返回鏈表的長度(不包括頭節點)
int LinkListLength(LinkList L)
{
int count = 0;
LinkList p;
p = L->next;
while(p)
{
p = p->next;
count++;
}
return count;
}
//判斷鏈表是否爲空
status isEmpty(LinkList L)
{
if(L->next)
return FALSE;
else
return TRUE;
}
//返回鏈表中第一個值爲e的位置
int FindElme(LinkList L, ElmeType e)
{
LinkList p;
int count = 0;
p = L->next;
while(p)
{
if(p->data != e)
{
count++;
p = p->next;
}
else
break;
}
if(count < LinkListLength(L))
return count + 1;
else
return -1;
}
//獲得鏈表中第i個元素的值
int GetElme(LinkList L, int i)
{
LinkList p;
p = L->next;
int j = 0;
if(i < 1 || i > LinkListLength(L))
return -1;
while(j < i - 1)
{
p = p->next;
j++;
}
return p->data;
}
//在第i個位置插入元素e
status InsertLinklist(LinkList *L, int i, ElmeType e)
{
LinkList p, q;
int j = 0;
p = (*L)->next;
if(i < 1 || i > LinkListLength((*L)))
return -1;
if(i == 1)
{
q = (LinkList)malloc(sizeof(Node));
(*L)->next = q;
q->data = e;
q->next = p;
return OK;
}
while(j < i - 2)
{
p = p->next;
j++;
}
q = (LinkList)malloc(sizeof(Node));
q->data = e;
q->next = p->next;
p->next = q;
return OK;
}
//刪除第i個位置的元素
int DeleteElme(LinkList *L, int i)
{
LinkList p, q;
int j = 0;
ElmeType e;
p = (*L)->next;
if(i < 1 || i > LinkListLength((*L)))
return -1;
if(i == 1)
{
e = p->data;
(*L)->next = (*L)->next->next;
delete(p);
return e;
}
while(j < i - 2)
{
j++;
p = p->next;
}
q = p->next;
e = q->data;
p->next = p->next->next;
delete(q);
return e;
}
int main()
{
status i;
int j, k;
LinkList L;
InitList(&L);
cout << "頭插法創建鏈表的長度：";
cin >> j;
CreateListHead(&L, j);
PrintLinkList(L);
cout << "鏈表長度爲：" << LinkListLength(L) << endl;
//DeleteList(&L);
cout << "請輸入你要查找的數值：";
cin >> j;
i = FindElme(L, j);
if(i != -1)
cout << "你查找的數值在鏈表中第" << i << "個位置!\n";
else
cout << "你要查找的數值不存在該鏈表中！\n";
cout << "請輸入你想要第幾個元素：";
cin >> j;
i = GetElme(L, j);
if(i != -1)
cout << "第" << j << "個元素的值爲:" << i << endl;
else
cout << "請輸入正確的索引\n";
cout << "請輸入要插入的位置和插入的元素:";
cin >> j >> k;
i = InsertLinklist(&L, j, k);
if(i != -1)
PrintLinkList(L);
else
cout << "請輸入正確的元素或正確的位置！\n";
cout << "請輸入要刪除位置的索引：";
cin >> j;
i = DeleteElme(&L, j);
if(i != -1)
{
cout << "刪除的元素爲：" << i << "刪除後的鏈表爲:\n";
PrintLinkList(L);
}
else
cout << "請輸入正確的索引!";
DeleteList(&L);
i = isEmpty(L);
if(i == 0)
cout << "鏈表不爲空\n";
else
cout << "鏈表爲空\n";
cout << "尾插法創建鏈表的長度：";
cin >> j;
CreateListTail(&L, j);
PrintLinkList(L);
return 0;
}