用链表实现栈

最新推荐文章于 2019-02-22 19:42:12 发布

舞夜幽灵之雏

最新推荐文章于 2019-02-22 19:42:12 发布

阅读量592

点赞数

文章标签：数据结构栈链表

本文链接：https://blog.csdn.net/niu2niu2niu/article/details/27349051

版权

用一般链表创建的逆向思维就可以。一般链表创建是新建一个节点作为已有节点的后续节点，而这里是新建一个节点作为已有节点的前驱节点。所以最新创建的节点在链表开头，即栈顶位置。

注意Push、Pop和DeleteStack都会改变栈顶指针，所以必须传引用

StackByList.h

#ifndef _STACK_H

typedef struct StackByList* PtrStackByList;
typedef struct StackByList* TopOfStackByList;

void Push(int X, TopOfStackByList &S);
int Pop(TopOfStackByList &S);
int Top(TopOfStackByList S);
bool IsEmpty(TopOfStackByList S);
void DeleteStack(TopOfStackByList &S);

#endif

struct StackByList
{
	int m_value;
	PtrStackByList m_next;
};

StackByList.cpp

#include "StdAfx.h"
#include "StackByList.h"

void Push(int X, TopOfStackByList &S)
{
	PtrStackByList P = NULL;
	P = new StackByList();
	P->m_value = X;
	P->m_next = S;
	S = P;
}

int Pop(TopOfStackByList &S)
{
	if (S == NULL)
		throw "Empty stack!";

	int top = 0;
	top = S->m_value;
	PtrStackByList P = S->m_next;
	delete S;
	S = P;

	return top;
}

int Top(TopOfStackByList S)
{
	if (S == NULL)
		throw "Empty stack!";

	return S->m_value;
}

bool IsEmpty(TopOfStackByList S)
{
	if (S == NULL)
		return true;
	else
		return false;
}

void DeleteStack(TopOfStackByList &S)
{
	while (S)
		Pop(S);
}