链表基础2(实现链表的逆序、将新结点插入到特定位置、边插结点边排序)
2017-02-09 23:43
399 查看
1、实现链表的逆序、将新结点插入特定位置
#include <stdio.h>
#include <stdlib.h>
#define SIZE 3
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node * Link;
void create_link(Link * head) //创建空链表
{
*head = NULL;
}
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) //输出结点
{
if(head == NULL)
{
printf("link empty!\n");
}
else
{
while(head != NULL)
{
printf("num = %d\n",head -> num);
head = head -> next;
}
printf("\n");
}
}
void reverse(Link * head) //将链表逆序
{
Link p1 = *head;
Link p2 = NULL;
Link p3 = NULL;
if(*head == NULL || (*head) -> next == NULL) //链表中没有或只有一个结点时
{
return;
}
else
{
p2 = p1 -> next; //链表中只有两个结点时
if(p2 -> next == NULL)
{
*head = p2;
p2 -> next = p1;
p1 -> next = NULL;
}
else
{
p3 = p2 -> next; //链表中至少有三个结点时
p2 -> next = p1;
while(p3 -> next != NULL)
{
p1 = p2;
p2 = p3;
p3 = p3 -> next;
p2 -> next = p1;
}
p3 -> next = p2;
(*head) -> next = NULL;
*head = p3;
}
}
}
void create_the_input_node(Link *the_input_node) //建立要插入的结点
{
*the_input_node = (Link)malloc(sizeof(Node));
if((*the_input_node) == NULL)
{
printf("malloc error!\n");
exit(-1);
}
printf("input_num = ");
scanf("%d",&(*the_input_node) -> num);
printf("\n");
}
void input_node(Link * head,Link the_input_node,int find_num) //把结点插入特定位置
{
Link p = NULL;
Link q = NULL;
p = *head;
while(p != NULL && p -> num != find_num)
{
q = p;
p = p -> next;
}
if(p == NULL) //链表中没有要找的num时
{
printf("can not find the num!\n");
}
else if(p == *head ||(*head) -> next == NULL) //只有一个结点时
{
the_input_node -> next = *head;
*head = the_input_node;
}
else //有一个以上结点时
{
q -> next = the_input_node;
the_input_node -> next = p;
}
}
int main()
{
Link head = NULL;
Link new_node = NULL;
Link the_input_node = NULL;
int i;
int find_num;
create_link(&head);
printf("Please input some numbers:\n");
for(i = 0;i < SIZE;i++)
{
new_node = (Link)malloc(sizeof(Node)); //给新的结点分配空间
if(new_node == NULL)
{
printf("malloc error!\n");
exit(-1);
}
scanf("%d",&(new_node -> num));
insert_node_tail(&head,new_node);
}
display_link(head);
printf("find_num = ");
scanf("%d",&find_num);
create_the_input_node(&the_input_node);
input_node(&head,the_input_node,find_num);
reverse(&head);
display_link(head);
return 0;
}
2、实现链表边插边排序的函数
void insert_node_sort(Link *head,Link new_node)
{
Link p = NULL;
Link q = NULL;
p = *head;
if(*head == NULL) //空链表时
{
new_node -> next = NULL;
*head = new_node;
}
else
{
while(p != NULL && p -> num < new_node -> num) //从小到大找出第一个等于或大于new node中num的结点
{
q = p;
p = p -> next;
}
if(p == *head) //new node作为第一个结点插入时
{
new_node -> next = *head;
*head = new_node;
}
else if(p == NULL) //new node 作为最后一个
9b43
结点插入时
{
q -> next = new_node;
new_node -> next = NULL;
}
else //new node作为中间结点插入
{
q -> next = new_node;
new_node -> next = p;
}
}
}
#include <stdio.h>
#include <stdlib.h>
#define SIZE 3
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node * Link;
void create_link(Link * head) //创建空链表
{
*head = NULL;
}
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) //输出结点
{
if(head == NULL)
{
printf("link empty!\n");
}
else
{
while(head != NULL)
{
printf("num = %d\n",head -> num);
head = head -> next;
}
printf("\n");
}
}
void reverse(Link * head) //将链表逆序
{
Link p1 = *head;
Link p2 = NULL;
Link p3 = NULL;
if(*head == NULL || (*head) -> next == NULL) //链表中没有或只有一个结点时
{
return;
}
else
{
p2 = p1 -> next; //链表中只有两个结点时
if(p2 -> next == NULL)
{
*head = p2;
p2 -> next = p1;
p1 -> next = NULL;
}
else
{
p3 = p2 -> next; //链表中至少有三个结点时
p2 -> next = p1;
while(p3 -> next != NULL)
{
p1 = p2;
p2 = p3;
p3 = p3 -> next;
p2 -> next = p1;
}
p3 -> next = p2;
(*head) -> next = NULL;
*head = p3;
}
}
}
void create_the_input_node(Link *the_input_node) //建立要插入的结点
{
*the_input_node = (Link)malloc(sizeof(Node));
if((*the_input_node) == NULL)
{
printf("malloc error!\n");
exit(-1);
}
printf("input_num = ");
scanf("%d",&(*the_input_node) -> num);
printf("\n");
}
void input_node(Link * head,Link the_input_node,int find_num) //把结点插入特定位置
{
Link p = NULL;
Link q = NULL;
p = *head;
while(p != NULL && p -> num != find_num)
{
q = p;
p = p -> next;
}
if(p == NULL) //链表中没有要找的num时
{
printf("can not find the num!\n");
}
else if(p == *head ||(*head) -> next == NULL) //只有一个结点时
{
the_input_node -> next = *head;
*head = the_input_node;
}
else //有一个以上结点时
{
q -> next = the_input_node;
the_input_node -> next = p;
}
}
int main()
{
Link head = NULL;
Link new_node = NULL;
Link the_input_node = NULL;
int i;
int find_num;
create_link(&head);
printf("Please input some numbers:\n");
for(i = 0;i < SIZE;i++)
{
new_node = (Link)malloc(sizeof(Node)); //给新的结点分配空间
if(new_node == NULL)
{
printf("malloc error!\n");
exit(-1);
}
scanf("%d",&(new_node -> num));
insert_node_tail(&head,new_node);
}
display_link(head);
printf("find_num = ");
scanf("%d",&find_num);
create_the_input_node(&the_input_node);
input_node(&head,the_input_node,find_num);
reverse(&head);
display_link(head);
return 0;
}
2、实现链表边插边排序的函数
void insert_node_sort(Link *head,Link new_node)
{
Link p = NULL;
Link q = NULL;
p = *head;
if(*head == NULL) //空链表时
{
new_node -> next = NULL;
*head = new_node;
}
else
{
while(p != NULL && p -> num < new_node -> num) //从小到大找出第一个等于或大于new node中num的结点
{
q = p;
p = p -> next;
}
if(p == *head) //new node作为第一个结点插入时
{
new_node -> next = *head;
*head = new_node;
}
else if(p == NULL) //new node 作为最后一个
9b43
结点插入时
{
q -> next = new_node;
new_node -> next = NULL;
}
else //new node作为中间结点插入
{
q -> next = new_node;
new_node -> next = p;
}
}
}
相关文章推荐
- 学习笔记——C语言实现单链表的基本操作:创建、输出、插入结点、删除结点、逆序链表
- C语言实现链表之单向链表(九)在任意位置插入结点
- 编写算法实现建立一个带头结点的含n个元素的双向循环链表H,并在链表H中的第i个位置插入一个元素e
- 链表的基本操作(创建,查找指定位置元素,删除指定元素,插入,倒置,去重,求集合的差,分别交换结点与交换结点值实现的冒泡排序,将两个有序链表合并成一个有序链表)c语言实现
- C语言实现链表之双向链表(九)在任意位置插入结点
- 链表的创建、测长、排序、插入、逆序的实现(C语言)
- C++链表的创建、插入、删除、查找、合并、排序、修改等操作的实现
- 链表:检测是否有环,是否相交,删除节点,插入节点,打印节点,建立节点,节点排序,节点逆序,
- 用结构体实现链表的创建、遍历、结点插入、结点删除
- C语言实现单向链表及其各种排序(含快排,选择,插入,冒泡)
- 插入排序的链表,无头结点
- 基础排序——冒泡排序、选择排序、插入排序的讲解、代码实现
- 用结构体实现链表的创建、遍历、结点插入、结点删除、链表删除-----带菜单选项
- 链表C++实现插入、删除元素,链表逆序
- 数据结构 29 排序 自己实现 插入排序 插入和归并综合排序 给链表排序
- <数据结构>单链表元素按插入方法排序实现
- java实现各种基础排序(冒泡排序、快速排序、直接选择排序、堆排序、直接插入排序、归并排序)
- 双链表排序--可以在任意位置正确插入节点
- 嵌入式 用链表实现直接选择排序和直接插入排序示例
- 链表的各种操作实现 链表逆序 链表排序 有序链表归并 链表存在环的判定