利用数组实现数据结构——栈

最新推荐文章于 2024-06-10 00:05:19 发布

原创最新推荐文章于 2024-06-10 00:05:19 发布 · 384 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#数据结构 #c #栈

本文介绍了一个简单的栈数据结构实现，包括创建、销毁栈的方法及如何进行压栈、弹栈等基本操作。通过定义结构体和指针，实现了栈的动态内存分配与管理。

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

Stack.h

#ifndef _STACK_H

typedef struct Stack * PtrStack;

void MakeEmpty(PtrStack S);
PtrStack CreateStack(int size);
bool IsFull(PtrStack S);
bool IsEmpty(PtrStack S);
void DeleteStack(PtrStack S);
void Push(int X, PtrStack S);
int Pop(PtrStack S);
int Top(PtrStack S);

#endif

struct Stack
{
	int capacityOfStack;
	int topOfStack;
	int * arrayOfStack;
};

Stack.cpp

#include "StdAfx.h"
#include "Stack.h"

#define EmptyTop (-1)

PtrStack CreateStack(int size)
{
	PtrStack S = NULL;
	S = new Stack();
	if (S == NULL)
		throw "Fail to new a stack!";

	S->arrayOfStack = new int[size]();
	if (S->arrayOfStack == NULL)
		throw "Fail to new array of stack!";
	S->capacityOfStack = size;
	MakeEmpty(S);

	return S;
}

void MakeEmpty(PtrStack S)
{
	S->topOfStack = EmptyTop;
}

bool IsFull(PtrStack S)
{
	if (S->topOfStack == S->capacityOfStack - 1)
		return true;
	else
		return false;
}

bool IsEmpty(PtrStack S)
{
	if (S->topOfStack == EmptyTop)
		return true;
	else
		return false;
}

void DeleteStack(PtrStack S)
{
	if (S)
	{
		delete[] S->arrayOfStack;
		delete S;
		S = NULL;
	}
}

void Push(int X, PtrStack S)
{
	if (IsFull(S))
		throw "The stack if full!";
	else
	{
		S->topOfStack++;
		S->arrayOfStack[S->topOfStack] = X;
	}
}

int Pop(PtrStack S)
{
	if (IsEmpty(S))
		throw "Empty stack!";
	else
		return S->arrayOfStack[S->topOfStack--];
}

int Top(PtrStack S)
{
	if (IsEmpty(S))
		throw "Empty stack!";
	else
		return S->arrayOfStack[S->topOfStack];
}