数据结构的概念、堆栈 - ToB企服应用市场:ToB评测及商务社交产业平台

/*
*
*链式物理结构固定代码
*
* */
#include<stdio.h>
typedef struct node {
int num;
struct node *p_next;
} node;
int main (){
node node1 = {10}, node2 = {20}, node3 = {30},head = {0}, tail = {0};
node *p_node = NULL;
head.p_next = &node1;
node1.p_next = &node2;
node2.p_next = &node3;
node3.p_next = &tail;
/*
*p_node指针循环变量会从头节点开始
*向后依次捆绑每个节点，直到最后一个有效节点为止
* */
for (p_node = &head;p_node != &tail;p_node = p_node->p_next){
/*
*以下三个指针和三个相邻节点捆绑
* 其中p_first指针捆绑的节点在最前面
*p_last指针捆绑的节点在最后
*p_mid指针捆绑的节点在中间
*p_mid指针在循环过程中从第一个有效节点一直捆绑到尾节点
* */
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");
return 0;
}

复制代码

/*
*
*链式结构
*
* */
#include<stdio.h>
typedef struct node {
int num;
struct node *p_next;
} node;
int main (){
node node1 = {10}, node2 = {20}, node3 = {30},head = {0}, tail = {0};
node node4 = {15};
node *p_node = NULL;
head.p_next = &node1;
node1.p_next = &node2;
node2.p_next = &node3;
node3.p_next = &tail;
/*
*p_node指针循环变量会从头节点开始
*向后依次捆绑每个节点，直到最后一个有效节点为止
*
* */
for (p_node = &head;p_node != &tail;p_node = p_node->p_next){
/*
*以下三个指针和三个相邻节点捆绑
* 其中p_first指针捆绑的节点在最前面
*p_last指针捆绑的节点在最后
*p_mid指针捆绑的节点在中间
*p_mid指针在循环过程中从第一个有效节点一直捆绑到尾节点
*
* */
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");
/*
*在链式结构里
*删除数据
* */
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 && p_mid->num == 20){
p_first->p_next = p_last;
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 || p_mid->num > node4.num){
p_first->p_next = &node4;
node4.p_next = p_mid;
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");
return 0;
}

复制代码

/*
*栈演示主函数
* */
#include<stdio.h>
#include"1stack.h"
int main (){
int num = 0;
stack stk = {0};
stack_init(&stk);
while (1){
printf("请输入一个数字:");
scanf("%d",&num);
if (num < 0){
break;
}
if (!stack_push(&stk,num)){
break;
}
}
while (1){
if (!stack_pop(&stk,&num)){
break;
}
printf("%d ",num);
}
printf("\n");
stack_deinit(&stk);
return 0;
}

复制代码

/*
*栈演示头文件
* */
#ifndef _1STACK_H_
#define _1STACK_H_
typedef struct {
int buf[SIZE];
int qty;
} stack;
//栈初始化函数
void stack_init (stack *);
//栈清理函数
void stack_deinit (stack *);
//统计栈里有效数字个数
int stack_size (const stack *);
//判断栈是否已经满了
int stack_full (const stack *);
//判断栈是否为空
int stack_empty (const stack *);
//向栈里加入数字的函数
int stack_push (stack *,int);
//从栈里获得数字的函数(从栈里删除数字)
int stack_pop (stack *,int *);
//从栈里获得数字的函数（不会删除数字）
int stack_top (const stack *,int *);
#endif //_1STACK_H_

复制代码

/*
*栈演示源文件
* */
#include"1stack.h"
//栈初始化函数
void stack_init (stack *p_stack){
p_stack->qty = 0;
}
//栈清理函数
void stack_deinit (stack *p_stack){
p_stack->qty = 0;
}
//统计栈里有效数字个数
int stack_size (const stack *p_stack){
return p_stack->qty;
}
//判断栈是否已经满了
int stack_full (const stack *p_stack){
return p_stack->qty >= SIZE;
}
//判断栈是否为空
int stack_empty (const stack *p_stack){
return !(p_stack->qty);
}
//向栈里加入数字的函数
int stack_push (stack *p_stack,int num){
if (p_stack->qty >= SIZE){
return 0;
}
p_stack->buf[p_stack->qty] = num;
p_stack->qty++;
return 1;
}
//从栈里获得数字的函数(从栈里删除数字)
int stack_pop (stack *p_stack,int *p_num){
if (!(p_stack->qty)){
return 0;
}
*p_num = p_stack->buf[p_stack->qty - 1];
p_stack->qty--;
return 1;
}
//从栈里获得数字的函数（不会删除数字）
int stack_top (const stack *p_stack,int *p_num){
if (!(p_stack->qty)){
return 0;
}
*p_num = p_stack->buf[p_stack->qty - 1];
return 1;
}

复制代码