第9章 用户自己建立数据类型
目录
1.定义一个结构体变量（包括年、月、日）。计算该日在本年中是第几天，注意闰年问题。
2.写一个函数days，实现第1题的计算。由主函数将年、月、日传递给days函数，计算后将日子数传回主函数输出。
3.编写一个函数print，打印一个学生的成绩数组，该数组中有5个学生的数据记录每个记录包括num, name, score[3]，用主函数输入这些记录，用print函数输出这些记录。
4.在第3题的基础上，编写一个函数input，用来输入5个学生的数据记录。
5.有10个学生，每个学生的数据包括学号、姓名、3门课程的成绩，从键盘输入10个学生数据，要求输出3门课程总平均成绩，以及最高分的学生的数据（包括学号、姓名、3门课程成绩、平均分数）。
6.13个人围成一圈，从第1个人开始顺序报号1, 2, 3。凡报到3者退出圈子。找出最后留在圈子中的人原来的序号。要求用链表实现。
10.已有a, b两个链表，每个链表中的结点包括学号、成绩。要求把两个链表合并，按学号升序排列。
11.有两个链表a和b，设结点中包含学号、姓名。从a链表中删去与b链表中有相同学号的那些结点。
12.建立一个链表，每个结点包括：学号、姓名、性别、年龄。输入一个年龄，如果链表中的结点所包含的年龄等于此年龄，则将此结点删去。
1.定义一个结构体变量（包括年、月、日）。计算该日在本年中是第几天，注意闰年问题。
#include <stdio.h>
struct date {
int year;
int month;
int day;
} d;
int monthDays[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
int i, res = 0;
printf("请输入年 月 日：");
scanf("%d %d %d", &d.year, &d.month, &d.day);
for(i = 1; i < d.month; i++) {
res += monthDays[i];
}
res += d.day;
if((d.year % 400 == 0) || (d.year % 4 == 0 && d.year % 100 != 0)) res += 1;
printf("\n%d年%d月%d日是第%d天\n", d.year, d.month, d.day, res);
return 0;
}
2.写一个函数days，实现第1题的计算。由主函数将年、月、日传递给days函数，计算后将日子数传回主函数输出。
#include <stdio.h>
struct date {
int year;
int month;
int day;
} d;
int monthDays[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int days(struct date *dd) {
int i, res = 0;
for(i = 1; i < dd->month; i++) {
res += monthDays[i];
}
res += dd->day;
if((dd->year % 400 == 0) || (dd->year % 4 == 0 && dd->year % 100 != 0)) res += 1;
return res;
}
int main() {
int res;
printf("请输入年 月 日：");
scanf("%d %d %d", &d.year, &d.month, &d.day);
res = days(&d);
printf("\n%d年%d月%d日是第%d天\n", d.year, d.month, d.day, res);
return 0;
}
3.编写一个函数print，打印一个学生的成绩数组，该数组中有5个学生的数据记录每个记录包括num, name, score[3]，用主函数输入这些记录，用print函数输出这些记录。
#include <stdio.h>
#define M 5
struct student {
int num;
char name[10];
float score[3];
} stu[M];
void print(struct student *pp) {
int i;
printf("\n\n********学生成绩表********\n\n");
printf("学号\t姓名\t成绩1\t成绩2\t成绩3\n");
for(i = 0; i < M; i++) {
printf("%d\t%s\t%.2f\t%.2f\t%.2f\n", pp[i].num, pp[i].name, pp[i].score[0], pp[i].score[1], pp[i].score[2]);
}
}
int main() {
int i;
struct student *p = stu;
for(i = 0; i < M; i++) {
printf("\n--学生%d：\n", i + 1);
printf("学号：");
scanf("%d", &(p[i].num));
printf("姓名：");
scanf("%s", p[i].name);
printf("成绩：");
scanf("%f %f %f", &(p[i].score[0]), &(p[i].score[1]), &(p[i].score[2]));
}
print(p);
return 0;
}
4.在第3题的基础上，编写一个函数input，用来输入5个学生的数据记录。
#include <stdio.h>
#define M 5
struct student {
int num;
char name[10];
float score[3];
} stu[M];
void input(struct student *pp) {
int i;
for(i = 0; i < M; i++) {
printf("\n--学生%d：\n", i + 1);
printf("学号：");
scanf("%d", &(pp[i].num));
printf("姓名：");
scanf("%s", pp[i].name);
printf("成绩：");
scanf("%f %f %f", &(pp[i].score[0]), &(pp[i].score[1]), &(pp[i].score[2]));
}
}
void print(struct student *pp) {
int i;
printf("\n\n********学生成绩表********\n\n");
printf("学号\t姓名\t成绩1\t成绩2\t成绩3\n");
for(i = 0; i < M; i++) {
printf("%d\t%s\t%.2f\t%.2f\t%.2f\n", pp[i].num, pp[i].name, pp[i].score[0], pp[i].score[1], pp[i].score[2]);
}
}
int main() {
int i;
struct student *p = stu;
input(p);
print(p);
return 0;
}
5.有10个学生，每个学生的数据包括学号、姓名、3门课程的成绩，从键盘输入10个学生数据，要求输出3门课程总平均成绩，以及最高分的学生的数据（包括学号、姓名、3门课程成绩、平均分数）。
#include <stdio.h>
#define M 10
struct student {
int num;
char name[10];
float score[3];
float ave;
} stu[M];
int main() {
int i, j, k;
float ave, sum = 0.0, max;
struct student *p = stu;
for(i = 0; i < M; i++) {
printf("\n--学生%d：\n", i + 1);
printf("学号：");
scanf("%d", &(p[i].num));
printf("姓名：");
scanf("%s", p[i].name);
printf("成绩：");
scanf("%f %f %f", &(p[i].score[0]), &(p[i].score[1]), &(p[i].score[2]));
p[i].ave = (p[i].score[0] + p[i].score[1] + p[i].score[2]) / 3;
sum += p[i].ave;
}
ave = sum / M;
max = p[0].ave;
k = 0;
for(i = 1; i < M; i++) {
if(max < p[i].ave) {
max = p[i].ave;
k = i;
}
}
printf("\n\n********学生成绩表********\n\n");
printf("学号\t姓名\t成绩1\t成绩2\t成绩3\t平均成绩\n");
for(i = 0; i < M; i++) {
printf("%d\t%s\t%.2f\t%.2f\t%.2f\t%.2f\n", p[i].num, p[i].name, p[i].score[0], p[i].score[1], p[i].score[2], p[i].ave);
}
printf("\n\n课程平均分：%.2f\n", ave);
printf("\n\n最高分学生数据：\n");
printf("学号\t姓名\t成绩1\t成绩2\t成绩3\t平均成绩\n");
printf("%d\t%s\t%.2f\t%.2f\t%.2f\t%.2f\n", p[k].num, p[k].name, p[k].score[0], p[k].score[1], p[k].score[2], p[k].ave);
return 0;
}
6.13个人围成一圈，从第1个人开始顺序报号1, 2, 3。凡报到3者退出圈子。找出最后留在圈子中的人原来的序号。要求用链表实现。
#include <stdio.h>
#include <stdlib.h>
#define M 13
struct person {
int data;
struct person* next;
} head;
int main() {
int i;
struct person *p = &head, *q;
for(i = 1; i < M + 1; i++) {
q = (struct person *)malloc(sizeof(struct person));
q->data = i;
p->next = q;
p = q;
}
p->next = &head; // 带头结点的循环单链表
i = 1;
p = head.next;
q = &head;
while(p->next != q) {
if(i == 3) {
q->next = p->next;
free(p);
i = 1;
p = q->next;
} else if(p->next == &head) {
p = head.next;
q = &head;
i++;
} else {
p = p->next;
q = q->next;
i++;
}
if(q->next == &head) {
p = head.next;
q = &head;
i = 1;
}
}
printf("\nres = %d\n", head.next->data);
return 0;
}
7-9
7.在第9章例9.9和例9.10的基础上，写一个函数del，用来删除动态链表中指定的结点。
8.写一个函数insert，用来向一个动态链表插入结点。
9.综合本章例9.9（建立链表的函数creat）、例9.10（输出链表的函数print）和本章习题第7题（删除链表中结点的函数del）、第8题（插入结点的函数insert），再编写一个主函数，先后调用这些函数。用以上5个函数组成一个程序，实现链表的建立、输出、删除和插入，在主函数中指定需要删除和插入的结点的数据。
#include <stdio.h>
#include <stdlib.h>
#define LEN sizeof(struct Student)
struct Student {
long num;
float score;
struct Student *next;
};
int n;
struct Student *creat(void) {
struct Student *head;
struct Student *p1, *p2;
n = 0;
p1 = p2 = (struct Student *)malloc(LEN);
scanf("%ld,%f", &p1->num, &p1->score);
head = NULL;
while(p1->num != 0) {
n = n + 1;
if(n == 1) head = p1;
else p2->next = p1;
p2 = p1;
p1 = (struct Student *)malloc(LEN);
scanf("%ld,%f", &p1->num, &p1->score);
}
p2->next = NULL;
return(head);
}
void print(struct Student *head) {
struct Student *p;
printf("\nNow, These %d records are:\n", n);
p = head;
if(head != NULL)
do {
printf("%ld %5.1f\n", p->num, p->score);
p = p->next;
} while(p != NULL);
}
struct Student *del(long num, struct Student *head) {
struct Student *p, *q;
int flag = 0;
p = head;
if(head == NULL) {
printf("\n是空表，删除失败！\n");
return;
}
while(p != NULL) {
if(p->num == num) {
if(p == head) head = p->next;
else q->next = p->next;
free(p);
n--;
flag = 1;
break;
}
q = p;
p = p->next;
}
if(flag == 0) {
printf("\n未找到学号为%ld的学生，删除失败！\n", num);
} else {
printf("\n删除成功！\n");
}
return(head);
}
struct Student *insert(long num, float score, struct Student *head, int i) {
if(i < 1 || i > n + 1) {
printf("\n插入位置有误，插入失败！\n");
return(head);
}
struct Student *p, *q;
p = head;
q = (struct Student *)malloc(LEN);
q->num = num;
q->score = score;
if(i == 1) {
q->next = p;
head = q;
} else {
for(; i > 2; i--) {
p = p->next;
}
q->next = p->next;
p->next = q;
}
n++;
return(head);
}
int main() {
struct Student *pt;
int i, j = 1, choice;
long num;
float score;
while (j) {
printf("\n\n\n\n");
printf("\n\t\t\t************************************");
printf("\n\t\t\t* 1-------例9.9 建 表 *");
printf("\n\t\t\t* 2------例9.10 显示线性表 *");
printf("\n\t\t\t* 3-------习题7 删 除 *");
printf("\n\t\t\t* 4-------习题8 插 入 *");
printf("\n\t\t\t* 0-------------退 出 *");
printf("\n\t\t\t************************************\n");
printf("\t\t\t请选择菜单号(1--4)：");
scanf("%d", &choice);
switch(choice) {
case 1:
pt = creat();
print(pt);
break;
case 2:
print(pt);
break;
case 3:
printf("\n\n请输入要删除的学号：");
scanf("%ld", &num);
pt = del(num, pt);
print(pt);
break;
case 4:
printf("\n\n请输入要插入的学号、成绩和位置(1~%d)：", n + 1);
scanf("%ld,%f,%d", &num, &score, &i);
pt = insert(num, score, pt, i);
print(pt);
break;
case 0:
j = 0;
printf("\t\t\t程序结束！\n");
break;
default:
printf("\n\t\t\t输入错误！请重新输入！\n");
}
}
return 0;
}
10.已有a, b两个链表，每个链表中的结点包括学号、成绩。要求把两个链表合并，按学号升序排列。
#include <stdio.h>
#include <stdlib.h>
#define LEN sizeof(struct Student)
struct Student {
long num;
float score;
struct Student *next;
};
struct Student *creat(void) {
struct Student *head;
struct Student *p1, *p2;
p1 = p2 = (struct Student *)malloc(LEN);
scanf("%ld,%f", &p1->num, &p1->score);
head = p1;
while(p1->num != 0) {
p2->next = p1;
p2 = p1;
p1 = (struct Student *)malloc(LEN);
scanf("%ld,%f", &p1->num, &p1->score);
}
p2->next = NULL;
return(head);
}
void print(struct Student *head) {
struct Student *p;
p = head;
if(head != NULL)
do {
printf("%ld, %.2f -> ", p->num, p->score);
p = p->next;
} while(p != NULL);
printf("NULL");
}
struct Student *connect(struct Student *p1, struct Student *p2) {
struct Student *s;
s = p1;
while(p1->next != NULL) {
p1 = p1->next;
}
p1->next = p2;
return(s);
}
struct Student *sort(struct Student *s) {
struct Student *p, *q;
p = s;
while(p->next != NULL) {
q = s;
while(q->next != NULL) {
if(q->num > q->next->num) {
long n = q->num;
float s = q->score;
q->num = q->next->num;
q->next->num = n;
q->score = q->next->score;
q->next->score = s;
}
q = q->next;
}
p = p->next;
}
return(s);
}
int main() {
struct Student *p1, *p2, *s;
printf("\n请输入链表1的学号和成绩\n");
p1 = creat();
printf("\n请输入链表2的学号和成绩\n");
p2 = creat();
printf("\n链表1：");
print(p1);
printf("\n链表2：");
print(p2);
s = connect(p1, p2);
printf("\n\n\n合并后：");
print(s);
s = sort(s);
printf("\n\n\n排序后：");
print(s);
return 0;
}
11.有两个链表a和b，设结点中包含学号、姓名。从a链表中删去与b链表中有相同学号的那些结点。
#include <stdio.h>
#include <stdlib.h>
#define LEN sizeof(struct Student)
struct Student {
long num;
float score;
struct Student *next;
};
struct Student *creat(void) {
struct Student *head;
struct Student *p1, *p2;
p1 = p2 = (struct Student *)malloc(LEN);
scanf("%ld,%f", &p1->num, &p1->score);
head = p1;
while(p1->num != 0) {
p2->next = p1;
p2 = p1;
p1 = (struct Student *)malloc(LEN);
scanf("%ld,%f", &p1->num, &p1->score);
}
p2->next = NULL;
return(head);
}
void print(struct Student *head) {
struct Student *p;
p = head;
if(head != NULL)
do {
printf("%ld, %.2f -> ", p->num, p->score);
p = p->next;
} while(p != NULL);
printf("NULL");
}
struct Student *deleteSame(struct Student *p1, struct Student *p2) {
struct Student *p = p1, *q = p2, *t;
while(p != NULL) {
while(q != NULL) {
if(p->num == q->num) {
if(p == p1) {
p1 = p->next;
t = p1;
} else {
t->next = p->next;
}
free(p);
p = t;
break;
}
q = q->next;
}
t = p;
p = p->next;
q = p2;
}
return(p1);
}
int main() {
struct Student *p1, *p2, *s;
printf("\n请输入链表1的学号和成绩\n");
p1 = creat();
printf("\n请输入链表2的学号和成绩\n");
p2 = creat();
printf("\n链表1：");
print(p1);
printf("\n链表2：");
print(p2);
p1 = deleteSame(p1, p2);
printf("\n\n\n删除相同学号后：");
print(p1);
return 0;
}
12.建立一个链表，每个结点包括：学号、姓名、性别、年龄。输入一个年龄，如果链表中的结点所包含的年龄等于此年龄，则将此结点删去。
#include <stdio.h>
#include <stdlib.h>
#define LEN sizeof(struct Student)
struct Student {
long num;
char name[10];
char sex[10];
int age;
struct Student *next;
};
struct Student *creat(int n) {
struct Student *head = NULL, *p1 = head, *p2;
int i = 1;
while(i <= n) {
p2 = (struct Student *)malloc(LEN);
printf("\n--学生%d：\n", i++);
printf("学号：");
scanf("%ld", &p2->num);
printf("姓名：");
scanf("%s", p2->name);
printf("性别：");
scanf("%s", p2->sex);
printf("年龄：");
scanf("%d", &p2->age);
if(head == NULL) head = p2;
else p1->next = p2;
p1 = p2;
}
p1->next = NULL;
return(head);
}
void print(struct Student *head) {
struct Student *p;
p = head;
if(head != NULL)
do {
printf("%ld, %s, %s, %d -> ", p->num, p->name, p->sex, p->age);
p = p->next;
} while(p != NULL);
printf("NULL");
}
struct Student *deleteSame(struct Student *p, int age) {
struct Student *p1 = p, *p2 = p;
while(p1 != NULL) {
if(p1->age == age) {
if(p1 == p) {
p = p1->next;
p2 = p;
} else {
p2->next = p1->next;
}
free(p1);
p1 = p2;
}
p2 = p1;
p1 = p1->next;
}
return(p);
}
int main() {
struct Student *p;
int n, age;
printf("\n请输入学生人数：");
scanf("%d", &n);
p = creat(n);
printf("\n链表：");
print(p);
printf("\n\n请输入要删除的年龄：");
scanf("%d", &age);
p = deleteSame(p, age);
printf("\n\n\n删除相同年龄后：");
print(p);
return 0;
}
2万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
