链表list

注：写算法时候一点要带本子演草，不然很可能有健壮性问题，考虑不周到。

学长手打数据结构。

（1）实验目的

通过该实验，深入理解链表的逻辑结构、物理结构等概念，掌握链表基本操作的编程实现，熟练掌握C语言中指针的操作。和实验3对比，掌握线性结构两种不同存储方式的区别。

（2）实验内容

编程实现链表下教材第二章定义的线性表的基本操作，最好用菜单形式对应各个操作，使其编程一个完整的小软件。注意，每个功能模块一定要考虑非法的情况，并作出相应的提示，例如：求前驱，要分别能够测试第一个元素的前驱、其他正常的元素的前驱、输入一个在表中不存在的元素求其前驱，这三种情况应给出相应的提示语和结果值；插入和删除时要考虑插入或删除的位置是否合法等。

（3）实验要求：

菜单项包括：

1.初始化或重置链表

2.销毁链表

3.清空链表

4.链表长度

5.指定位置的元素值

6.链表已存在元素的位序

7.求输入元素的直接前驱

8.求输入元素的直接后继

9.在第i个位置插入一个元素

10.删除第i个元素

11.输出有的链表元素

12.初始化并用头插法（或尾插法）输入元素

13.实现单链表的逆序存放

#include<iostream>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
typedef struct node {
	int ID;
	double score;
	struct node* next;

}NODE;
NODE* createLink() {//初始化或重置链表
	NODE* head = new NODE;
	if (head == NULL) {
		cout << "没空间了奥" << endl;
		exit(1);
	}
	head->next = NULL;
	return head;
}
NODE* createNode(int id,double score) {//增加node
	NODE* p = new NODE();
	if (p == NULL) {
		cout << "没空间了奥" << endl;
		exit(1);
	}
	p->ID = id;
	p->score = score;
	p->next = NULL;

	return p;

}
int isEmpty(NODE* head) {//判空
	return head->next == NULL;
}
int destory(NODE* head) {//销毁链表
	//free(head);
	delete[] head;
	return 1;
}

int clear(NODE* head) {//清空链表
	if (head->next == NULL) {
		printf("本来就是空!\n");
		return 0;
	}
	NODE* p = head->next;
	head->next = NULL;
	//free(p);
	delete[] p;
	return 1;
}
int linkLength(NODE* head) {//链表长度
	int num = 0;
	NODE* p = head;
	while (p->next != NULL) {
		num++;
		p = p->next;
	}
	return num;

}
NODE* findNode(NODE* head, int offset) {//指定位置的元素值
	NODE* p = head;
	for (int i = 0; i <offset; i++)
	{
		if (p->next != NULL)
		{
			p = p->next;
		}
		else
		{
			return NULL;
		}
		
		
		
	}
	return p;
}
int find(NODE* head, int findID) {//链表已存在元素的位序
	NODE* p = head->next;
	int num = 0;
	while (p!= NULL)
	{
		num++;
		if (findID == p->ID) {
			return num;
		}
		p = p->next;
	}
		return 0;
}
//NODE* findp(NODE* head, int findID) {
//}

NODE* preNode(NODE* head, int id) {//求输入元素的直接前驱
	NODE* p = head;
	NODE* tmp = NULL;
	while (p->next!=NULL)
	{
		tmp = p;
		p = p->next;
		if (p->ID == id&&tmp!=head) {
			return tmp;
		}
	}
	return NULL;
}
NODE* nextNode(NODE* head,int id) {//求输入元素的直接后继
	NODE* p = head;
	NODE* tmp = NULL;
	while (p->next != NULL)
	{
		tmp = p;
		p = p->next;
		if (tmp->ID == id) {
			return p;
		}
	}
	return NULL;
}
//void insertFirst(NODE* head, NODE* newNode) {
//}

void insert(NODE* head, NODE* newNode, int offset) {//在第i个位置插入一个元素
	NODE* p = head;
	for (int i = 0; i < offset-1; i++)
	{
		p = p->next;
		if (p == NULL) {
			cout << "超出范围" << endl;
			return;
		}
	}
	newNode->next = p->next;
	p->next = newNode;
}
int del(NODE* head, int offset) {//删除第i个元素
	NODE* p = head;
	NODE* tmp = NULL;
	for (int i = 0; i < offset-1; i++)
	{
		p = p->next;
		if (p->next == NULL) {
			cout << "超出范围" << endl;
			return 0;
		}
	}
	tmp = p->next;
	p->next=p->next->next;
	if(tmp!=NULL){
		free(tmp);
	}
	return 1;
}

//int delLast(NODE* head) {
//}

void printLink(NODE* head) {//输出有的链表元素
	NODE* p;
	p = head->next;
	while (p != NULL) {
		//printf("ID:%d score:%lf ->",p->ID,p->score);
		cout << p->ID;
		p = p->next;
	}
	printf("NULL\n");
}
void append(NODE* head, NODE* newNode) {//初始化并用头插法（或尾插法）输入元素" 
	NODE* p = head;

	while (p->next != NULL) {
		p = p->next;
	}
	p->next = newNode;
	newNode->next = NULL;

}
int main() {
	cout << "1----初始化或重置链表" << endl;
	cout << "2----销毁链表" << endl;
	cout << "3---清空链表" << endl;
	cout << "4----链表长度" << endl;
	cout << "5----指定位置的元素值" << endl;
	cout << "6----链表已存在元素的位序" << endl;
	cout << "7----求输入元素的直接前驱" << endl;
	cout << "8----求输入元素的直接后继" << endl;
	cout << "9----.在第i个位置插入一个元素" << endl;
	cout << "10----删除第i个元素" << endl;
	cout << "11----输出有的链表元素" << endl;
	cout << "12----初始化并用头插法（或尾插法）输入元素" << endl;
	//cout << "13----实现单链表的逆序存放" << endl;
	int m = 0;
	NODE* head=NULL;
	NODE* newNode=NULL;
	int i;
	NODE* tmp;
	int newID;
	double newScore;
	int offset;
	while (m != -1) {
		cout << "请输入功能" << endl;
		cin >> m;

		switch (m) {
		case 1:head = createLink();
			cout << "初始化成功" << endl;
			break;
		case 2:destory(head);
			break;
		case 3:clear(head);
			break;
		case 4:
			linkLength(head);
			cout << "链表长度为" << linkLength(head) << endl;
			break;
		case 5:
			cout << "输入你想查询的位置" << endl;
			cin >> offset;
			tmp = findNode(head, offset);
			if (tmp != NULL) {
				cout << "id为" << tmp->ID << "分数为" << tmp->score << endl;
			}
			else {
				cout << "没找到" << endl;
			}
			break;
		case 6:
			printf("Please input ID:\n");
			cin >> newID;
			offset = find(head, newID);
			if (offset == 0) {
				cout << "没找到" << endl;
			}
			printf("%d\n", offset); break;

		case 7:printf("Please input ID:\n");
			cin >> newID;

			tmp = preNode(head, newID);
			if (tmp != NULL) {
				printf("%d, %lf\n", tmp->ID, tmp->score);
			}
			else {
				printf("找不到这个节点或者这个节点没有前驱!\n");
			}; break;
		case 8:
			printf("Please input ID:\n");
			cin >> newID;

			tmp = nextNode(head, newID);
			if (tmp != NULL) {
				printf("%d, %lf\n", tmp->ID, tmp->score);
			}
			else {
				printf("Not found!\n");
			}; break;
		case 9:
			printf("Please input ID&score:\n");
			cin >> newID;
			cin >> newScore;
			
			newNode = createNode(newID, newScore);
			printf("Please input the offset you want insert to:\n");
			cin >> offset;
			insert(head, newNode, offset); break;
		case 10:
			printf("Please input offset:\n");
			cin >> offset;
			del(head, offset);
			printLink(head); break;
		case 11:
			printLink(head); break;

		case 12:for (i = 0; i < 3; i++) {
			printf("输入3次ID和分数来初始化\n");
			cin >> newID;
			cin >> newScore;

			newNode = createNode(newID, newScore);
			append(head, newNode);
		}break;

		}
		
	}
	system("pause");
	return 0;
}