头插
#include <stdio.h>
#include <stdlib.h>
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node* Link;
void create_link(Link *head) //创建空链表
{
*head = NULL;
}
void create_node(Link * new_node) //分配内存空间
{
*new_node = (Link)malloc(sizeof(Node));
if(*new_node == NULL)
{
printf("malloc error!\n");
exit(-1);
}
}
void display_link(Link head) //输出
{
Link p;
p = head;
if(head == NULL)
{
printf("link is empty!\n");
return;
}
while(p != NULL)
{
printf("%d\n",p -> num);
p = p -> next;
}
}
void insert_node_head(Link *head,Link new_node) //头插
{
new_node -> next = *head;
*head = new_node;
}
void release_link(Link *head)
{
Link p;
p = *head;
while((*head) != NULL)
{
*head = (*head) -> next;
free(p);
p = *head;
}
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
create_link(&head); //创建空链表
for(i = 0;i < 10;i++)
{
create_node(&new_node); //分配内存空间
new_node -> num = i + 1;
insert_node_head(&head,new_node); //头插
}
display_link(head); //输出
release_link(&head); //释放
display_link(head);
return 0;
}
尾插
#include <stdio.h>
#include <stdlib.h>
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node* Link;
void create_link(Link *head) //创建空链表
{
*head = NULL;
}
void create_node(Link *new_node) //分配内存空间
{
*new_node = (Link)malloc(sizeof(Node));
if(*new_node == NULL)
{
printf("malloc error!\n");
exit(-1);
}
}
void insert_node_tail(Link *head,Link new_node) //尾插
{
Link p;
p = *head;
if((*head) == NULL)
{
*head = new_node;
new_node -> next = NULL;
}
else
{
while(p -> next != NULL)
{
p = p -> next;
}
p -> next = new_node;
new_node -> next = NULL;
}
}
void display_link(Link head)
{
Link p;
p = head;
if(head == NULL)
{
printf("link is empity!\n");
return;
}
while(p != NULL)
{
printf("%d\n",p -> num);
p = p -> next;
}
}
void release_link(Link *head)
{
Link p;
p = *head;
while((*head) != NULL)
{
*head = (*head) -> next;
free(p);
p = *head;
}
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
create_link(&head); //创建链表
for(i = 0;i < 10;i++)
{
create_node(&new_node); //分配内存空间
new_node -> num = i + 1;
insert_node_tail(&head,new_node); //尾插
}
display_link(head); //输出
release_link(&head); //释放
display_link(head);
return 0;
}
中间插入(前插后插)
#include <stdio.h>
#include <stdlib.h>
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node* Link;
void create_link(Link *head) //创建一个空链表
{
*head = NULL;
}
void create_node(Link *new_node) //分配内存空间
{
*new_node = (Link)malloc(sizeof(Node));
if(*new_node == NULL)
{
printf("malloc error!\n");
exit(-1);
}
}
void insert_node_tail(Link *head,Link new_node) //尾插
{
Link p;
p = *head;
if((*head) == NULL)
{
*head = new_node;
new_node -> next = NULL;
}
else
{
while(p -> next != NULL)
{
p = p -> next;
}
p -> next = new_node;
new_node -> next = NULL;
}
}
void display_link(Link head) //输出
{
Link p;
p = head;
if(head == NULL)
{
printf("link is empity!\n");
return;
}
while(p != NULL)
{
printf("%d\n",p -> num);
p = p -> next;
}
}
void release_link(Link *head) //释放
{
Link p;
p = *head;
while((*head) != NULL)
{
*head = (*head) -> next;
free(p);
p = *head;
}
}
void insert_node_midf(Link *head,Link new_node,int loc) //中间插入前插
{
Link p,q;
p = q = *head;
if((*head) -> num == loc)
{
new_node -> next = *head;
*head = new_node;
}
else
{
while(p != NULL && p -> num != loc)
{
q = p;
p = p -> next;
}
q -> next = new_node;
new_node -> next = p;
}
}
void insert_node_midl(Link *head,Link new_node,int loc) // 中间插入后插
{
Link p,q;
p = q = *head;
if((*head) -> num == loc)
{
p = p -> next;
(*head) -> next = new_node;
new_node -> next = p;
}
else
{
while(p != NULL && q -> num != loc)
{
q = p;
p = p -> next;
}
q -> next = new_node;
new_node -> next = p;
}
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
create_link(&head); //创建链表
for(i = 0;i < 10;i++)
{
create_node(&new_node); //分配内存空间
new_node -> num = i + 1;
insert_node_tail(&head,new_node); //尾插
}
display_link(head); //输出
printf("输入一个新的结点:\n");
create_node(&new_node);
scanf("%d",&new_node -> num);
int loc;
printf("输入插入的位置:\n");
scanf("%d",&loc);
// insert_node_midf(&head,new_node,loc); //中间插入前插
insert_node_midl(&head,new_node,loc); //中间插入后插
display_link(head);
release_link(&head); //释放
display_link(head);
return 0;
}
删除结点
#include <stdio.h>
#include <stdlib.h>
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node* Link;
void create_link(Link *head) //创建空链表
{
*head = NULL;
}
void create_node(Link *new_node) //分配内存空间
{
*new_node = (Link)malloc(sizeof(Node));
if(*new_node == NULL)
{
printf("malloc error!\n");
exit(-1);
}
}
void insert_node_tail(Link *head,Link new_node) //尾插
{
Link p;
p = *head;
if((*head) == NULL)
{
*head = new_node;
new_node -> next = NULL;
}
else
{
while(p -> next != NULL)
{
p = p -> next;
}
p -> next = new_node;
new_node -> next = NULL;
}
}
void display_link(Link head) //输出
{
Link p;
p = head;
if(head == NULL)
{
printf("link is empity!\n");
return;
}
while(p != NULL)
{
printf("%d\n",p -> num);
p = p -> next;
}
}
void release_link(Link *head)
{
Link p;
p = *head;
while((*head) != NULL)
{
*head = (*head) -> next;
free(p);
p = *head;
}
}
void delete_link(Link *head,int temp) //删除结点
{
Link p,q;
p = q = *head;
if((*head) -> num == temp)
{
*head = (*head) -> next;
free(p);
p = q = *head;
}
else
{
while(p != NULL && p -> num != temp)
{
q = p;
p = p -> next;
}
if (p) //进行判断p是否为真
{
q -> next = p -> next;
free(p);
}
else //当p超出结点范围
{
printf("所要删除的结点超出范围!\n");
}
}
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
create_link(&head); //创建链表
for(i = 0;i < 10;i++)
{
create_node(&new_node); //分配内存空间
new_node -> num = i + 1;
insert_node_tail(&head,new_node); //尾插
}
display_link(head); //输出
int temp;
printf("输入所要删除的结点位置:\n");
scanf("%d",&temp);
delete_link(&head,temp); //删除指定结点
display_link(head);
release_link(&head); //释放
display_link(head);
return 0;
}
作业
11: 输入一段字符串,无论是否有重复字母出现,都只打印出现过的小写字母,并按照小写字母顺序打印。
(如输入qewqwr322rqw<>211qESFSSEraZz, 打印aeqrwz)
#include <stdio.h>
#define N 100
int main()
{
char a[N] = {0};
char b[N] = {0};
printf("输入字符串:\n");
scanf("%s",a);
int i;
int temp = 0;
for(i = 0;i < *(a + i);i++)
{
temp = *(a + i) - 97;
*(b + temp + 97) = '+';
}
for(i = 97;i < 97 + 26;i++)
{
if(*(b + i) == '+')
{
printf("%c",i);
}
}
printf("\n");
return 0;
}
12:输入某个月的第N周和这一周的第M天,通过int *GetDay() 函数获取参数并返回结果,来得出这一天是这个月的第多少天。
(如输入:3,4,即这个月的第3周的第4天,即这个月的第18天)
#include <stdio.h>
int *Getday(int week,int day)
{
int *D = NULL;
int x = (week - 1) * 7 + day;
D = &x;
return D;
}
int main()
{
int *D = NULL;
int week,day;
printf("输入周和这周的第几天:\n");
scanf("%d%d",&week,&day);
D = Getday(week,day);
printf("%d\n",*D);
return 0;
}
13:(1)建立一个顺序表,要求从键盘输入10个整数,并将该顺序表的元素从屏幕显示出来。
(2)用函数实现在顺序表中查找其中一个元素,如果找到,返回该元素在顺序表中的位置和该元素的值,否则提示无此元素。
(3)用函数实现顺序表的插入和删除操作。由用户输入待插入元素及插入位置,将完成插入后的顺序表输出;由用户输入删除第几个元素,将完成删除后的顺序表输出。
#include <stdio.h>
#include <stdlib.h>
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node* Link;
void create_link(Link *head) //创建空链表
{
*head = NULL;
}
void create_node(Link *new_node) //分配内存空间
{
*new_node = (Link)malloc(sizeof(Node));
if(*new_node == NULL)
{
printf("malloc error!\n");
exit(-1);
}
}
void insert_node_tail(Link *head,Link new_node) //尾插
{
Link p;
p = *head;
if((*head) == NULL)
{
*head = new_node;
new_node -> next = NULL;
}
else
{
while(p -> next != NULL)
{
p = p -> next;
}
p -> next = new_node;
new_node -> next = NULL;
}
}
void display_link(Link head) //输出
{
Link p;
p = head;
if(head == NULL)
{
printf("link is empty!\n");
}
while(p != NULL)
{
printf("%d\n",p -> num);
p = p -> next;
}
}
void release_link(Link *head) //释放
{
Link p;
p = *head;
while((*head) != NULL)
{
*head = (*head) -> next;
free(p);
p = *head;
}
}
void search_link(Link *head,int n) //查找
{
Link p;
int count = 1;
p = *head;
if(*head == NULL)
{
printf("link is empty!\n");
}
while(p != NULL && p -> num != n)
{
count++;
p = p -> next;
}
if(p)
{
printf("find it!No.%d\n",count);
}
else
{
printf("can not find!\n");
}
}
void insert_node_midf(Link *head,Link new_node,int loc) //中间插入前插
{
Link p,q;
p = q = *head;
if((*head) -> num == loc)
{
new_node -> next = *head;
*head = new_node;
}
else
{
while(p != NULL && p -> num != loc)
{
q = p;
p = p -> next;
}
q -> next = new_node;
new_node -> next = p;
}
}
void delete_link(Link *head,int temp) //删除结点
{
Link p,q;
p = q = *head;
if((*head) -> num == temp)
{
*head = (*head) -> next;
free(p);
p = q = *head;
}
else
{
while(p != NULL && p -> num != temp)
{
q = p;
p = p -> next;
}
if(p)
{
q -> next = p -> next;
free(p);
}
else
{
printf("不能找到要删除的数!\n");
}
}
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
int a[10];
printf("输入数字:\n");
for(i = 0;i < 10;i++)
{
printf("a[%d]=",i);
scanf("%d",&a[i]);
}
create_link(&head); //创建链表
for(i = 0;i < 10;i++)
{
create_node(&new_node); //分配内存空间
new_node -> num =a[i];
insert_node_tail(&head,new_node); //尾插
}
display_link(head); //输出
int n;
printf("输入一个数:\n");
scanf("%d",&n);
search_link(&head,n); //查找
int loc;
printf("输入插入位置:\n");
scanf("%d",&loc);
printf("输入插入的元素值:\n");
create_node(&new_node);
scanf("%d",&new_node -> num);
insert_node_midf(&head,new_node,loc); //中间插入前插
display_link(head);
int temp;
printf("输入要删除的结点值:\n");
scanf("%d",&temp);
delete_link(&head,temp); //删除结点
display_link(head);
release_link(&head); //释放
display_link(head);
return 0;
}