1、题目:创建两个学生链表,含有姓名、年龄的信息,一个链表存放男生,一个链表存放女生
#include <stdio.h>
#include <stdlib.h>
#define MAL_OK 1
#define MAL_ERR 0
struct node
{
int age;
char name[20];
struct node * next;
};
typedef struct node Node;
typedef struct node * Link;
void create_link(Link * head) //head为二级指针。
{
*head = NULL;
}
void insert_node_tail(Link *head,Link new_node)
{
Link p;
p = *head;
if(p == NULL)
{
*head = new_node;
new_node->next = NULL;
}
else
{
while(p->next != NULL)
{
p = p->next;
}
p->next = new_node;
new_node->next = NULL;
}
}
int malloc_ok(Link new_node)
{
if(new_node == NULL)
{
return MAL_ERR;
}
else
{
return MAL_OK;
}
}
void create_node(Link * new_node)
{
(*new_node) = (Link) malloc(sizeof(Node)); //创建空间,malloc返回void型指针要进行强类型转换。
while(malloc_ok(*new_node) == MAL_ERR)
{
(*new_node) = (Link) malloc(sizeof(Node));
}
}
void display(Link head)
{
Link p;
p = head;
if(p == NULL)
{
printf("Link is empty!\n");
}
else
{
while(p != NULL)
{
printf("age = %5d\t",p->age);
printf("name = %s\n",p->name);
p = p->next; //指向下一个
}
}
}
void release_link(Link * head)
{
Link p;
p = *head;
if(p == NULL)
{
printf("link is empty!\n");
}
else
{
while(*head != NULL)
{
*head = (*head)->next;
free(p);
p = *head;
}
}
}
int main()
{
Link head1 = NULL; //创建头指针。
Link head2 = NULL;
Link new_node = NULL;//新结点的指针
Link p;
int i;
int man,woman;
create_link(&head1); //创建链表
create_link(&head2); //创建链表
printf("请输入男人的数量。\n");
scanf("%d",&man);
printf("请输入女人的数量。\n");
scanf("%d",&woman);
for(i = 0; i < man; i++)
{
create_node(&new_node);
insert_node_tail(&head1,new_node);
}
for(i = 0; i < woman; i++)
{
create_node(&new_node);
insert_node_tail(&head2,new_node);
}
p = head1;
for(i = 0; i < man; i++)
{
printf("请输入男人年龄。\n");
scanf("%d",&p->age);
printf("请输入男人姓名。\n");
scanf("%s",&p->name);
p = p->next;
}
p = head2;
for(i = 0; i < woman; i++)
{
printf("请输入女人年龄。\n");
scanf("%d",&p->age);
printf("请输入女人姓名。\n");
scanf("%s",&p->name);
p = p->next;
}
printf("man:\n");
display(head1);
printf("woman:\n");
display(head2);
release_link(&head1);
release_link(&head2);
return 0;
}
2、题目:将上面两个链表合并,按学生的年龄进行排序,合成新的链表
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct str
{
char name[10];
int age;
struct str *next;
}str;
str *insert_list(str *temp,char name[],int age)
{
str *p = (str*)malloc(sizeof(str));
strcpy(p->name,name);
p->age = age;
p->next = temp;
temp = p;
return temp;
}
int display_list(str *p)
{
printf("out:\n");
while(p)
{
printf("%s\t%d\n",p->name,p->age);
p = p->next;
}
}
str *connect(str *q,str *p)
{
str *temp=NULL;
temp = q;
if(temp==NULL)
{
return p;
}
while(temp->next!=NULL)
{
temp = temp->next;
}
temp->next = p;
return q;
}
str *rank_list(str *p)
{
str *temp = p;
str *ptr = p;
int between=0;
char string[10];
while(temp->next)
{
while(ptr->next)
{
if((ptr->age)>(ptr->next->age))
{
between = ptr->age;
ptr->age = ptr->next->age;
ptr->next->age = between;
strcpy(string,ptr->name);
strcpy(ptr->name,ptr->next->name);
strcpy(ptr->next->name,string);
}
ptr = ptr->next;
}
temp = temp->next;
ptr = p;
}
return p;
}
int main()
{
str *student = NULL;
str *Man = NULL;
str *Woman = NULL;
Man = insert_list(Man,"zhangsan",14);
Man = insert_list(Man,"lisi",13);
Man = insert_list(Man,"zhaosan",12);
Man = insert_list(Man,"wangwu",15);
Woman = insert_list(Woman,"zhangli",16);
Woman = insert_list(Woman,"shenli",10);
Woman = insert_list(Woman,"xiaoli",11);
student=connect(Man,Woman);
student=rank_list(student);
printf("学生");
display_list(student);
return 0;
}
3、题目:将上题中建立的链表进行反转,实现按年龄的逆序排列
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct str
{
char name[10];
int age;
struct str *next;
}str;
str *insert_list(str *temp,char name[],int age)
{
str *p = (str*)malloc(sizeof(str));
strcpy(p->name,name);
p->age = age;
p->next = temp;
temp = p;
return temp;
}
int display_list(str *p)
{
printf("out:\n");
while(p)
{
printf("%s\t%d\n",p->name,p->age);
p = p->next;
}
}
str *connect(str *q,str *p)
{
str *temp=NULL;
temp = q;
if(temp==NULL)
{
return p;
}
while(temp->next!=NULL)
{
temp = temp->next;
}
temp->next = p;
return q;
}
str *rank_list(str *p)
{
str *temp = p;
str *ptr = p;
int between=0;
char string[10];
while(temp->next)
{
while(ptr->next)
{
if((ptr->age)<(ptr->next->age))
{
between = ptr->age;
ptr->age = ptr->next->age;
ptr->next->age = between;
strcpy(string,ptr->name);
strcpy(ptr->name,ptr->next->name);
strcpy(ptr->next->name,string);
}
ptr = ptr->next;
}
temp = temp->next;
ptr = p;
}
return p;
}
int main()
{
str *student = NULL;
str *Man = NULL;
str *Woman = NULL;
Man = insert_list(Man,"zhangsan",14);
Man = insert_list(Man,"lisi",13);
Man = insert_list(Man,"zhaosan",12);
Man = insert_list(Man,"wangwu",15);
Woman = insert_list(Woman,"zhangli",16);
Woman = insert_list(Woman,"shenli",10);
Woman = insert_list(Woman,"xiaoli",11);
student=connect(Man,Woman);
student=rank_list(student);
printf("学生");
display_list(student);
return 0;
}
4、题目:在上面的实现的新链表中,给定一个年龄,迅速查找和该学生年龄最接近的学生姓名
提示:使用双向链表
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct stu
{
char name[10];
int age;
struct stu *next;
struct stu *before;
}stu;
stu * insert_list(stu *p,char name[],int age)
{
stu *temp = (stu*)malloc(sizeof(stu));
strcpy(temp->name,name);
temp->age = age;
if(p==NULL)
{
temp->next = NULL;
temp->before = NULL;
p = temp;
return p;
}
temp->before=NULL;
temp->next=p;
p->before=temp;
p = temp;
return p;
}
void find_list(stu *p)
{
int a[50]={0};
stu *temp = p;
int age=0;
int i=0;
int j=0;
int num=100;
int match=-1;
printf("请输入一个年龄:");
scanf("%d",&age);
while(temp)
{
a[i] = (temp->age) - age;
temp = temp->next;
if(a[i]<0)
{
a[i]=0-a[i];
}
i++;
}
for(j=0;j<i;j++)
{
if(a[j]<num)
{
num = a[j];
match = j;
}
}
temp = p;
for(j=0;j<match;j++)
{
temp = temp ->next;
}
printf("最匹配的同学:%s\n",temp->name);
}
void display(stu *student)
{
stu *p = student;
while(p)
{
printf("%s , %d\n",p->name,p->age);
p = p->next;
}
}
int main()
{
stu *student=NULL;
student=insert_list(student,"zhangsan",11);
student=insert_list(student,"lisi",12);
student=insert_list(student,"wangwu",13);
student=insert_list(student,"zhaoyi",14);
student=insert_list(student,"qianer",15);
display(student);
find_list(student);
return 0;
}
5、题目:比较顺序表和链表的优缺点,说说它们分别在什么场景下使用?
顺序表:
优点:内存中地址连续,优点是随机访问比较便捷快速,创建也比较简单,随机查找比较方便,可以直接给出下标,排序也方便简单。
缺点:不够灵活,删除增加的工作量叫大,比较麻烦,长度不能实时变化
适用场景:适用于需要大量访问元素的 而少量增添/删除元素的程序
单链表:
优点:内存中地址不是连续的,优点是插入删除比较方便,长度可以实时变化。
缺点:不支持随机查找,查找元素需要遍历。
适用场景:适用于需要进行大量增添/删除元素操作 而对访问元素无要求的程序