function4.cpp

#include<iostream>
#include<stdlib.h>
#include <easyx.h>
#include<algorithm>
//#include<time.h>
using namespace std;
//从这开始是静态链表的程序
int avi = 0;
struct node2 {
	int next = 0;
	int key = 0;
} aa[10000];
int find_end() {
	int num = 0;
	while (aa[num].next) {
		num = aa[num].next;
	}
	return num;
}
void insert_end(int x) {
	int now = find_end();
	avi++;
	aa[avi].key = x;
	aa[now].next = avi;
	//	cout<<"now="<<now<<" avi="<<avi<<" avi.next="<<a[now].next<<" avi.key"<<a[now].key<<endl; 
}
void del(int x) {
	//x是数值
	int now=0,pre;
	while (1) {
		
		if (aa[now].key == x) {
			aa[pre].next = aa[now].next;

			return;
		}
		pre = now;
		now = aa[now].next;
		
	}
}
void outout() {
	if (aa[0].next == 0)cout << "当前链表为空";
	int num = 1;
	while (aa[num].next) {
		cout << "当前节点下标为：" << num << "当前节点的后继下标:" << aa[num].next << "当前的节点值为" << aa[num].key << endl;
		num = aa[num].next;
	}
	cout << "最后一个节点值：" << aa[num].key;
	cout << endl;
}
void function16() {
	cout << "      动态链表创建器开始运行" << endl << "————————————————" << endl;
	char a[10];
	InputBox(a, 10, "输入原始链表长度");
	closegraph();
	int c = atoi(a);
	//int place, x;
	int x;
	bool back = false;
	cout << "请输入原始链表：";
	for (int i = 1; i <= c; i++) {
		int x;
		cin >> x;
		insert_end(x);
	}
	cout << endl;

	while (1) {
		cout << "请输入操作：" << endl;
		cout << "1.尾端插入一个数" << endl;
		cout << "2.删除一个数" << endl;
		cout << "3.输出链表" << endl;
		cout << "4.退出该模式" << endl;
		int select;
		cout << "操作：";
		cin >> select;
		cout << endl;
		switch (select)
		{
		case 1:
			//cout << "输入插入链表位置:";
			//cin >> place;
			cout << "输入尾端插入的数：";
			cin >> x;
			insert_end(x);
			break;
		case 2:
			cout << "输入删除链表中哪个数";
			cin >> x;
			del(x);
			break;
		case 3:
			outout();
			cout << endl;
			break;
		case 4:
			back = true;
			break;
		default:
			break;
		}
		if (back) break;
	}

	cout << endl << "————————————————" << endl << endl << endl;
	return;
}
//静态链表程序到此结束

//从这开始是动态链表的程序
struct node {
	int data;
	node* next;
};
struct node* creat_link();
void delete_link(struct node* head, int place) {
	struct node* p, * pre;
	int i;
	pre = head;
	for (i = 0; i < place - 1; i++)
		pre = pre->next;
	p = pre->next;
	pre->next = p->next;
	free(p);
}
void insert_link(struct node* head, int place, int x) {
	struct node* p, * pre;
	int i;
	pre = head;
	for (i = 0; i < place - 1; i++)
		pre = pre->next;  
	p = (struct node*)malloc(sizeof(struct node));
	p->data = x;
	p->next = pre->next;
	pre->next = p;
}
void output_link(struct node* head) {
	struct node* p;
	cout << "输出链表为：\n";
	p = head->next;
	while (p != NULL) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
struct node* creat_link(int lenth) {
	node* head, * p, * pre;
	//用node 定义了三个指针变量
//	malloc方法：
//	head=pre=(struct node *)malloc(sizeof(struct node)) ;
//	new方法：
	head = pre = new node;
	//头结点；空链表建立
	head->next = NULL;
	//建立整个链表
	cout << "请输入原始链表，共"<<lenth<<"个数："<<endl;
	for (int i = 1; i <= lenth; i++) {
		int x;
		cin >> x;
		//p=(struct node *)malloc(sizeof(struct node) );
		p = new node;
		p->next = NULL;  //p总是指向新结点
		p->data = x;
		pre->next = p;
		pre = p;       //pre总是指向当前链表的表尾
	}
	return head;
}
void function17() {
	cout << "      动态链表创建器开始运行" << endl << "————————————————" << endl;
	char a[10];
	InputBox(a, 10, "输入原始链表长度");
	closegraph();
	int c = atoi(a);
	
	struct node* head;
	int place, x;
	bool back = false;
	head = creat_link(c);
	cout << endl;

	while (1) {
		cout << "请输入操作：" << endl;
		cout << "1.插入一个数" << endl;
		cout << "2.删除一个数" << endl;
		cout << "3.输出链表" << endl;
		cout << "4.退出该模式" << endl;
		int select;
		cout << "操作：";
		cin >> select;
		cout << endl;
		switch (select)
		{
		case 1:
			cout << "输入插入链表位置:";
			cin >> place;
			cout << "输入插入的数：";
			cin >> x;
			insert_link(head, place, x);
			break;
		case 2:
			cout << "输入删除链表的位置";
			cin >> place;
			delete_link(head, place);
			break;
		case 3:
			output_link(head);
			cout << endl;
			break;
		case 4:
			back = true;
			break;
		default:
			break;
		}
		if (back) break;
	}

	cout << endl<<"————————————————" << endl << endl << endl;
	//system("pause");
	//cout << "按任意键返回主界面" << endl;
	//getchar();
	return;
}
//动态链表程序到此结束

//学生排序计算器从此开始
struct node1 {//结构体排序
	int xh;
	char name[100];
	int grade;
}a[99];
bool cmp(struct node1 c, struct node1 d)//比较函数
	{
		if (c.grade< d.grade)
		{
			return true;
		}
		return false;
	}
void function18() {
	closegraph();
	cout << "      学生排序计算器开始运行" << endl << "————————————————"<<endl ;
	char a1[10];
	InputBox(a1, 10, "你想排序几个学生");
	int c = atoi(a1);
	//MessageBox(0, "请在命令行窗口输入学生的数据", "提示", MB_OK);
	
	for (int i = 1; i <= c; i++) {
		cout << "请输入第" << i << "个学生的学号:";
		cin >> a[i].xh;
		cout << "请输入第" << i << "个学生的姓名:";
		cin >> a[i].name;
		cout << "请输入第" << i << "个学生的成绩:";
		cin >> a[i].grade;
		cout << endl;
	}
	
	sort(a + 1, a + c+1,cmp);
	int sum = 0;
	for (int i = 1; i <= c; i++)
	{
		printf("学号:%d 姓名:%s 成绩:%d\n", a[i].xh, a[i].name, a[i].grade);
		sum += a[i].grade;
	}
	cout << "————————————————" << endl;
	printf("总成绩: %d\n", sum);
	printf("平均成绩: %.1lf\n", double(sum) / c);
	cout << "————————————————" << endl << endl << endl;
	system("pause");
	return;
}
//学生排序计算器到此结束

void function19() {
	closegraph();
	cout << "      素数判断计算器开始运行" << endl << "————————————————" << endl;
	char a1[10];
	InputBox(a1, 10, "请输入素数");
	int x = atoi(a1);
	if (x == 2) {
		cout << x << "是素数"<<endl;
		cout << "————————————————" << endl << endl << endl;
		system("pause");
		return;
	}
	for (int i = 2; i <= sqrt(x); i++)
		if (x % i == 0) {
			cout << x << "不是素数"<<endl;
			cout << "————————————————" << endl << endl << endl;
			system("pause");
			return;
		}
	cout << x << "是素数"<<endl;
	cout << "————————————————" << endl << endl << endl;
	system("pause");
	return;
}

void function20() {
	cout << "      学生成绩增长器开始运行" << endl << "————————————————" << endl;
	char a[10];
	InputBox(a, 10, "学生成绩涨多少分？");
	int c = atoi(a);
	closegraph();
	int tmp[11];
	system("dir d:");
	cout << endl<<endl;
	cout << "上面，是否在D盘根目录存在学生数据文件？(y/n)";
	char choice;
	cin >> choice;
	if (choice!='y')
	{
		cout << "请在D盘目录下放入学生数据文件，10个。";
		cout << "————————————————" << endl << endl << endl;
		return;
	}

	FILE* fp;
	fp = fopen("d:\\my.txt", "r+");
	for (int i = 1; i <= 10; i++) {
		fscanf(fp, "%d", &tmp[i]);
	}
	rewind(fp);
	for (int i = 1; i <= 10; i++) {
		fprintf(fp, "%d\n", tmp[i] + c);
	}
	fclose(fp);
	cout << "处理已完成"<<endl;
	cout << "————————————————" << endl << endl << endl;
	system("pause");
	
	getchar();
	return;
}