/*
链式物理结构演示
*/
#include <stdio.h>
#include <stdlib.h>
typedef struct node {
int num;
struct node *p_next;
} node;
void remove_num(node *p_head, int num) {
node *p_node = NULL;
for (p_node = p_head;p_node->p_next != NULL;p_node = p_node->p_next) {
node *p_first = p_node;
node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
if (p_mid->p_next != NULL && p_mid->num == num) {
p_first->p_next = p_last;
free(p_mid);
p_mid = NULL; //这儿释放内存是因为我们要把p_mid里面存放的数字删除所以我们要释放
break;
}
}
}
void insert_in_order(node *p_head, int num) {
node *p_node = NULL;
for (p_node = p_head;p_node->p_next != NULL;p_node = p_node->p_next) {
node *p_first = p_node;
node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
if (p_mid->p_next == NULL || p_mid->num > num) {
p_tmp->num = num;
p_first->p_next = p_tmp;
p_tmp->p_next = p_mid;
}
break;
}
}
}
void append(node *p_head, int num) {
node *p_node = NULL;
for (p_node = p_head;p_node->p_next != NULL;p_node = p_node->p_next) {
node *p_first = p_node;
node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
if (!(p_mid->p_next)) {
node *p_tmp = (node *)malloc(sizeof(node));
if (p_tmp) {
p_tmp->num = num;
p_first->p_next = p_tmp;
p_tmp->p_next = p_mid;
}
break;
}
}
}
int main() {
int num = 0;
node head = {0}, tail = {0}, *p_node = NULL;
head.p_next = &tail;
while (1) {
printf("请输入一个数字:");
scanf("%d", &num);
if (num >= 0) {
insert_in_order(&head, num);
}
else {
break;
}
}
for (p_node = &head;p_node != &tail;p_node = p_node->p_next) {
node *p_first = p_node;
node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
if (p_mid != &tail) {
printf("%d ", p_mid->num);
}
}
printf("\n");
printf("请输入一个要删除的数字:");
scanf("%d", &num);
remove_num(&head, num);
for (p_node = &head;p_node != &tail;p_node = p_node->p_next) {
node *p_first = p_node;
node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
if (p_mid != &tail) {
printf("%d ", p_mid->num);
}
}
printf("\n");
node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
p_first->p_next = p_last;
free(p_mid);
p_mid = NULL;
}
return 0;
}
链式物理结构演示
*/
#include <stdio.h>
#include <stdlib.h>
typedef struct node {
int num;
struct node *p_next;
} node;
void remove_num(node *p_head, int num) {
node *p_node = NULL;
for (p_node = p_head;p_node->p_next != NULL;p_node = p_node->p_next) {
node *p_first = p_node;
node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
if (p_mid->p_next != NULL && p_mid->num == num) {
p_first->p_next = p_last;
free(p_mid);
p_mid = NULL; //这儿释放内存是因为我们要把p_mid里面存放的数字删除所以我们要释放
break;
}
}
}
void insert_in_order(node *p_head, int num) {
node *p_node = NULL;
for (p_node = p_head;p_node->p_next != NULL;p_node = p_node->p_next) {
node *p_first = p_node;
node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
if (p_mid->p_next == NULL || p_mid->num > num) {
node *p_tmp = (node *)malloc(sizeof(node)); //动态分配内存存放node类型的数据 分配过后我们还要使用所以我们没有立即在这个函数里面释放
现在这个动态内存是存放有数据的存放的是链式节点数据 所以我们只需要在最后不用这些数据的时候把动态内 存释放 程序的{}就是一个作用域 运行完之后就会自动回收里面的内存 但是这个是动态内存是不会回收的相 当于存在了链式物理的存储里面 只能等到自己手动回收或者由程序结束自己回收
if (p_tmp) {p_tmp->num = num;
p_first->p_next = p_tmp;
p_tmp->p_next = p_mid;
}
break;
}
}
}
void append(node *p_head, int num) {
node *p_node = NULL;
for (p_node = p_head;p_node->p_next != NULL;p_node = p_node->p_next) {
node *p_first = p_node;
node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
if (!(p_mid->p_next)) {
node *p_tmp = (node *)malloc(sizeof(node));
if (p_tmp) {
p_tmp->num = num;
p_first->p_next = p_tmp;
p_tmp->p_next = p_mid;
}
break;
}
}
}
int main() {
int num = 0;
node head = {0}, tail = {0}, *p_node = NULL;
head.p_next = &tail;
while (1) {
printf("请输入一个数字:");
scanf("%d", &num);
if (num >= 0) {
insert_in_order(&head, num);
}
else {
break;
}
}
for (p_node = &head;p_node != &tail;p_node = p_node->p_next) {
node *p_first = p_node;
node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
if (p_mid != &tail) {
printf("%d ", p_mid->num);
}
}
printf("\n");
printf("请输入一个要删除的数字:");
scanf("%d", &num);
remove_num(&head, num);
for (p_node = &head;p_node != &tail;p_node = p_node->p_next) {
node *p_first = p_node;
node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
if (p_mid != &tail) {
printf("%d ", p_mid->num);
}
}
printf("\n");
while (head.p_next != &tail) { 这儿就是释放动态内存的,这里因为后面没用那个链式数据了所以释放了虽然main函数自己运行完了也会自动释放但是在程序一直运行 的时候比如某些服务器程序这些内存是不会被释放的 还是自己手动释放安全点 以前想歪了动态内存释放按照字面意思理解就好
node *p_first = &head;node *p_mid = p_first->p_next;
node *p_last = p_mid->p_next;
p_first->p_next = p_last;
free(p_mid);
p_mid = NULL;
}
return 0;
}