链栈的系列函数

最新推荐文章于 2022-11-12 23:02:41 发布

夜卜.

最新推荐文章于 2022-11-12 23:02:41 发布

阅读量97

点赞数

本文链接：https://blog.csdn.net/weixin_45396618/article/details/118828385

版权

这篇博客主要实现了一个C语言程序，用于检查给定的入栈顺序是否能形成特定的出栈顺序。通过创建链式栈并模拟入栈和出栈操作，程序判断出栈序列是否合法。在`main.c`中定义了主要的判断函数`is_stack_in_out`，并在`linkedstack.c`和`linkedstack.h`中实现了链式栈的相关操作如入栈、出栈、获取栈顶元素等。

摘要由CSDN通过智能技术生成

快捷跳转

main.c

#include <stdio.h>
#include <stdlib.h>

#include "linkedstack.h" 

//入栈顺序保存在in[]数组中，out[]数组序列能不能作为出栈序列 
bool is_stack_in_out(int in[],int out[],int n){
	LinkedStack stack = linked_stack_create();
	int i,j=0;
	int top = 0;
	for(i=0;i<n;i++){
		linked_stack_push(stack,in[i]);
		while(!linked_stack_empty(stack)){
			linked_stack_top(stack,&top);
			if(top == out[j]){
				linked_stack_pop(stack,NULL);
				++j;
			}else{
				break;
			}
		}
	}
	bool ret = linked_stack_empty(stack);
	linked_stack_destroy(stack);
	return ret;
}

int main(int argc, char *argv[]) {
	int in[5] = {1,2,3,4,5};
	int out[5] = {};
	printf("请输入[1-5]序列:");
	int i;
	for(i=0;i<5;i++){
		scanf("%d",&out[i]);
	}
	if(is_stack_in_out(in,out,5)){
		printf("Right!\n");
	}else{
		printf("Not!\n");
	}
	return 0;
}

linkedstack.h

#ifndef _LINKED_STACK_H__
#define _LINKED_STACK_H__

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

typedef struct Node{
	int data;
	struct Node *next;
}Node,*LinkedStack;

#define NODESIZE sizeof(struct Node)

LinkedStack linked_stack_create(void);
bool linked_stack_empty(LinkedStack stack);
size_t linked_stack_size(LinkedStack stack);
int linked_stack_push(LinkedStack stack,int data);
int linked_stack_pop(LinkedStack stack,int *pdata);
int linked_stack_top(LinkedStack stack,int *pdata);
//void  linked_stack_clear(LinkedStack stack);
void linked_stack_destroy(LinkedStack stack);


#endif //_LINKED_STACK_H__

linkedstack.c

#include "linkedstack.h"



LinkedStack linked_stack_create(void){
	LinkedStack stack = (LinkedStack)malloc(NODESIZE);
	if(stack!=NULL){
		stack->next = NULL;
	}
	return stack;
}
bool linked_stack_empty(LinkedStack stack){
	return stack->next == NULL;
}
size_t linked_stack_size(LinkedStack stack){
	size_t size = 0;
	struct Node *node = stack->next;
	while(node!=NULL){
		++size;
		node = node->next;
	} 
	return size;
}
int linked_stack_push(LinkedStack stack,int data){
	struct Node *node = (struct Node *)malloc(NODESIZE);
	if(node == NULL)
		return -1;
	node->data = data;
	node->next = stack->next;
	stack->next = node;
	return 0;
}
int linked_stack_pop(LinkedStack stack,int *pdata){
	if(stack->next == NULL)
		return -1;
	if(pdata != NULL)
		*pdata = stack->next->data;
	struct Node *node = stack->next;
	stack->next = node->next;
	free(node);
	return 0;
}
int linked_stack_top(LinkedStack stack,int *pdata){
	if(stack->next == NULL)
		return -1;
	*pdata = stack->next->data;
	return 0;
}
//void  linked_stack_clear(LinkedStack stack);
void linked_stack_destroy(LinkedStack stack){
	while(!linked_stack_empty(stack))
		linked_stack_pop(stack,NULL);
	free(stack);
}