#include"iostream"
using namespace std;
#define MAXSIZE 50
#define false 0
#define ok 1
#define error 0
#define true 1
typedef int ElemType;
typedef int status;
typedef struct Node
{
ElemType data;
struct Node *next;
}Node;
typedef struct Node* Linklist;
status GetElem(Linklist L, int i, ElemType* e);//链式表取元素
void List_scan(Linklist head);//遍历链表
int List_length(Linklist head);//求链表的长度
status query_Elem(Linklist head, ElemType e);//从链表里面查找某一元素
status insert_Elem(Linklist head, int i, ElemType e);//链表的插入操作
Linklist newlist(ElemType data[], int n);//创建一个链表——头插法,头插法得到的元素顺序与数组顺序相反
Linklist new_list_rear(ElemType data[], int n);//尾插法实现创建新表
status delete_node(Linklist head, ElemType e);//单链表结点的删除
void clear_list(Linklist head);//单链表空间释放
int main()
{
ElemType data[8];//尾插法创建单链表测试
cout << "请输入你要创建的元素,以空格隔开" << endl;
for (int i = 0; i < (sizeof(data) / sizeof(data[0])); i++)//向数组中输入数据
{
cin >>data[i];
}
Linklist head = new_list_rear(data, (sizeof(data) / sizeof(data[0])));//用于存储新建表的指针
//head=new_list_rear(data, (sizeof(data) / sizeof(data[0])));//创建表返回表头指针
List_scan(head);//测试便历单链表
/*cout << "表的长度是" << List_length(head) << endl;//测试表的长度
cout << "请输入你要从链表中取出元素的位序" << endl;//测试取出表中某位置元素
int Get_Elem_loc;
cin >> Get_Elem_loc;
ElemType e1=100;//存储取出元素位置
GetElem(head, Get_Elem_loc, &e1);
cout << e1 << endl;
int flag=0;//测试查询某元素是否存在表中
flag=query_Elem(head, 22);
if (flag == 1)cout << "查有此人" << endl;
else cout << "查无此人" << endl;
insert_Elem(head, 3, 88);//测试链表的插入操作
List_scan(head);*/
delete_node(head, 8);//测试删除某节点
List_scan(head);
}
status GetElem(Linklist L, int i, ElemType*e)//链式表取元素
{
int j = 1;
Linklist p = L->next;
while (p && j < i)
{
p = p->next;
j++;
}
if (i < j || !p)
{
return 0;
}
*e = p->data;
}
void List_scan(Linklist head)//遍历链表
{
Linklist p;
p = head->next;
while (p!=NULL)
{
cout << p->data << endl;
p = p->next;
}
}
int List_length(Linklist head)//求链表的长度
{
int count = 0;
Linklist p;
p = head->next;
while (p!=NULL)
{
count++;
p = p->next;
}
return count;
}
status query_Elem(Linklist head,ElemType e)//从链表里面查找某一元素
{
Linklist p;
p = head->next;
while (p != NULL)
{
if (p->data == e)
{
cout << e << endl;
return true;
}
p = p->next;
}
return false;
}
status insert_Elem(Linklist head, int i, ElemType e)//链表的插入操作
{
int count = 0;
Linklist p;
p = head;//注意此刻指向头结点而非首节点,这样做的目的是使得在首节点之前插入节点同样可以使用此程序段
while (p != NULL && count < i - 1)//使得指针指向i-1节点
{
count++;
p = p->next;
}
if (p == NULL || i < 1)return false;
else
{
Linklist insert_node = (Linklist)malloc(sizeof(Node));
insert_node->data = e;
insert_node->next = p->next;
p->next = insert_node;
return true;
}
}
Linklist newlist(ElemType data[], int n)//创建一个链表——头插法,头插法得到的元素顺序与数组顺序相反
{
Linklist head = (Linklist)malloc(sizeof(Node));
head->next = NULL;
int i;
for (i = 0; i < n; i++)
{
Linklist node = (Linklist)malloc(sizeof(Node));
node->data = data[0];
node->next = head->next;
head->next = node;
}
return head;
}
Linklist new_list_rear(ElemType data[], int n)//尾插法实现创建新表
{
Linklist head = (Linklist)malloc(sizeof(Node));
Linklist rear = head;
head->next = NULL;
int i;
for (i = 0; i < n; i++)
{
Linklist node = (Linklist)malloc(sizeof(Node));
node->data = data[i];
rear->next = node;
rear = node;
}
rear->next = NULL;
return head;
}
status delete_node(Linklist head, ElemType e)//单链表结点的删除
{
if (head == NULL || head->next == NULL)
{
return false;
}
Linklist p = head->next;
Linklist q= head;
while (p != NULL)
{
cout << p;
if (p->data == e)
{
q->next = p->next;
free(p);
return true;
}
else
{
q = p;
p = p->next;
}
}
return false;
}
void clear_list(Linklist head)//单链表空间释放
{
Linklist p;
if (head == NULL || head->next == NULL)free(head);
while (head->next != NULL)
{
p = head;
head = head->next;
free(p);
}
}在这里插入代码片
数据结构之单链表的相关操作
最新推荐文章于 2023-05-07 21:40:08 发布