C/C++ 知识回顾栈的入栈与出栈

最新推荐文章于 2024-11-20 22:24:36 发布

原创最新推荐文章于 2024-11-20 22:24:36 发布 · 2.6k 阅读

1 ·

CC 4.0 BY-SA版权

C++ 专栏收录该内容

68 篇文章

订阅专栏

本文介绍了一个简单的栈数据结构实现方法，使用C++编程语言通过结构体定义节点与栈，并提供了入栈(push)与出栈(pop)的操作实现。该实现考虑了空栈情况及如何在非空栈中正确进行元素的添加与移除。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
using namespace std;
typedef struct student
{
	int data;
	struct student * next;
}node;

typedef struct stackqueque
{
	node * top, *zhandi;
} Stack;

Stack * push(Stack * stack,int num)
{
	node *s = (node *)malloc(sizeof(node));
	s->data = num;
	s->next = NULL;
	if (stack->top==NULL)
	{
		stack->top = s;
		stack->zhandi = s;
	}
	else
	{
		stack->top->next = s;
		stack->top = s;
	}
	return stack;
}
int  pop(Stack *stack)
{
	if (stack->top==NULL)
	{
		cout << "栈为空" << endl;
		return -1;
	}
	if (stack->top==stack->zhandi)
	{
		int x = stack->top->data;
		stack->top = NULL;
		stack->zhandi = NULL;
		return x;
	}
	else
	{
		
		node*	p = stack->zhandi;
		while (p->next!=stack->top)
		{
			p = p->next;
		}
		node *q = stack->top;
		int x = stack->top->data;
		p->next = NULL;
		stack->top = p;
		free(q);
		return x;

	}
	
}
int main()
{

}