链式栈代码,C代码库,德仔网

代码语言
代码分类
【C】链式栈
作者:一男 / 发布于2015/11/12/ 1050
链式栈

	// ConsoleApplication2-链式栈.cpp : 定义控制台应用程序的入口点。
	//
	
	#include "stdafx.h"
	#include<iostream>
	using namespace std;
	
	
	template<class T>
	class LinkedStack;
	
	template<class T>
	class LinkNode //链表结点类的定义
	{
	public:
	 friend class LinkedStack<T>;
	 LinkNode(LinkNode<T> *nnext = NULL)
	 { next = nnext; }
	 LinkNode(T t, LinkNode<T> *nnext = NULL)
	 { data = t; next = nnext; }
	private:
	 T data;
	 LinkNode<T> *next;
	};
	
	template <class T>
	class LinkedStack
	{
	public:
	 LinkedStack();
	 LinkedStack(int t); //构造一个空栈 S
	 ~LinkedStack(); //销毁已存在的栈S
	 int getStackLength(); //返回 S 的元素个数，即栈的长度
	 bool IsStackEmpty(); //若栈 S 为空栈，则返回 TRUE，否则 FALE
	 bool GetTop(T &t); //用 e 返回 S 的栈顶元素
	 void makeEmpty(); //将 S 清为空栈
	 bool Push(T t); //插入元素 e 为新的栈顶元素
	 bool Pop(T &t); //删除 S 的栈顶元素，并用 e 返回其值
	 void StackTravers(void(*visit)(T e)); //遍历元素
	private:
	 LinkNode<T> *first;
	 int length, maxlength;
	};
	
	template<class T>
	LinkedStack<T>::LinkedStack(int t)
	{
	 first = new LinkNode<T>;
	 length = 0;
	 maxlength = t;
	}
	
	template<class T>
	LinkedStack<T>::~LinkedStack()
	{
	 makeEmpty();
	}
	
	template<class T>
	bool LinkedStack<T>::Push(T t)
	{
	 if (getStackLength()==maxlength)
	 {
	 return false;
	 }
	 else
	 {
	 LinkNode<T> *current;
	 LinkNode<T> *newNode = new LinkNode<T>(t);
	 current = first->next;
	 first->next = newNode;
	 newNode->next = current;
	 length++;
	 return true;
	 }
	}
	
	template<class T>
	int LinkedStack<T>::getStackLength()
	{
	 return length;
	}
	
	template<class T>
	void LinkedStack<T>::makeEmpty()
	{
	 LinkNode<T> *current;
	 while (first->next != NULL) {
	 current = first->next;
	 first->next = current->next;
	 delete current;
	 }
	}
	
	template<class T>
	void LinkedStack<T>::StackTravers(void(*visit)(T e))
	{
	 LinkNode<T>* current = first->next;
	 while (current != NULL)
	 {
	 visit(current->data);
	 current = current->next;
	 }
	}
	
	template<class T>
	bool LinkedStack<T>::GetTop(T &t)
	{
	 LinkNode<T>* current = first->next;
	 if (current==NULL)
	 {
	 return false;
	 }
	 else
	 {
	 t = current->data;
	 return true;
	 }
	}
	
	template<class T>
	bool LinkedStack<T>::IsStackEmpty()
	{
	 if (length==0)
	 {
	 return true;
	 }
	 else
	 {
	 return false;
	 }
	}
	
	template<class T>
	bool LinkedStack<T>::Pop(T &t)
	{
	 if (first->next==NULL)
	 {
	 return false;
	 }
	 else
	 {
	 LinkNode<T> *current;
	 current = first->next;
	 t = current->data;
	 first->next = current->next;
	 delete current;
	 length--;
	 return true;
	 }
	}
	
	void visit(int t)
	{
	 cout << "#_:" << t << endl;
	}
	
	int main()
	{
	 void visit(int t); //声明visit函数，该函数在遍历函数中使用
	 LinkedStack<int> L_1(2);
	 int i = 5,j;
	 L_1.Push(i);
	 L_1.StackTravers(visit);
	 L_1.Push(i+1);
	 L_1.StackTravers(visit);
	 L_1.GetTop(j); cout << j<<endl;
	 L_1.Pop(j); cout << j << endl;
	 L_1.StackTravers(visit);
	 return 0;
	}

	

	

	

	

	

	

	// ConsoleApplication2-链式栈.cpp : 定义控制台应用程序的入口点。
	//
	
	#include "stdafx.h"
	#include<iostream>
	using namespace std;
	
	
	template<class T>
	class LinkedStack;
	
	template<class T>
	class LinkNode //链表结点类的定义
	{
	public:
	 friend class LinkedStack<T>;
	 LinkNode(LinkNode<T> *nnext = NULL)
	 { next = nnext; }
	 LinkNode(T t, LinkNode<T> *nnext = NULL)
	 { data = t; next = nnext; }
	private:
	 T data;
	 LinkNode<T> *next;
	};
	
	template <class T>
	class LinkedStack
	{
	public:
	 LinkedStack();
	 LinkedStack(int t); //构造一个空栈 S
	 ~LinkedStack(); //销毁已存在的栈S
	 int getStackLength(); //返回 S 的元素个数，即栈的长度
	 bool IsStackEmpty(); //若栈 S 为空栈，则返回 TRUE，否则 FALE
	 bool GetTop(T &t); //用 e 返回 S 的栈顶元素
	 void makeEmpty(); //将 S 清为空栈
	 bool Push(T t); //插入元素 e 为新的栈顶元素
	 bool Pop(T &t); //删除 S 的栈顶元素，并用 e 返回其值
	 void StackTravers(void(*visit)(T e)); //遍历元素
	private:
	 LinkNode<T> *first;
	 int length, maxlength;
	};
	
	template<class T>
	LinkedStack<T>::LinkedStack(int t)
	{
	 first = new LinkNode<T>;
	 length = 0;
	 maxlength = t;
	}
	
	template<class T>
	LinkedStack<T>::~LinkedStack()
	{
	 makeEmpty();
	}
	
	template<class T>
	bool LinkedStack<T>::Push(T t)
	{
	 if (getStackLength()==maxlength)
	 {
	 return false;
	 }
	 else
	 {
	 LinkNode<T> *current;
	 LinkNode<T> *newNode = new LinkNode<T>(t);
	 current = first->next;
	 first->next = newNode;
	 newNode->next = current;
	 length++;
	 return true;
	 }
	}
	
	template<class T>
	int LinkedStack<T>::getStackLength()
	{
	 return length;
	}
	
	template<class T>
	void LinkedStack<T>::makeEmpty()
	{
	 LinkNode<T> *current;
	 while (first->next != NULL) {
	 current = first->next;
	 first->next = current->next;
	 delete current;
	 }
	}
	
	template<class T>
	void LinkedStack<T>::StackTravers(void(*visit)(T e))
	{
	 LinkNode<T>* current = first->next;
	 while (current != NULL)
	 {
	 visit(current->data);
	 current = current->next;
	 }
	}
	
	template<class T>
	bool LinkedStack<T>::GetTop(T &t)
	{
	 LinkNode<T>* current = first->next;
	 if (current==NULL)
	 {
	 return false;
	 }
	 else
	 {
	 t = current->data;
	 return true;
	 }
	}
	
	template<class T>
	bool LinkedStack<T>::IsStackEmpty()
	{
	 if (length==0)
	 {
	 return true;
	 }
	 else
	 {
	 return false;
	 }
	}
	
	template<class T>
	bool LinkedStack<T>::Pop(T &t)
	{
	 if (first->next==NULL)
	 {
	 return false;
	 }
	 else
	 {
	 LinkNode<T> *current;
	 current = first->next;
	 t = current->data;
	 first->next = current->next;
	 delete current;
	 length--;
	 return true;
	 }
	}
	
	void visit(int t)
	{
	 cout << "#_:" << t << endl;
	}
	
	int main()
	{
	 void visit(int t); //声明visit函数，该函数在遍历函数中使用
	 LinkedStack<int> L_1(2);
	 int i = 5,j;
	 L_1.Push(i);
	 L_1.StackTravers(visit);
	 L_1.Push(i+1);
	 L_1.StackTravers(visit);
	 L_1.GetTop(j); cout << j<<endl;
	 L_1.Pop(j); cout << j << endl;
	 L_1.StackTravers(visit);
	 return 0;
	}

	

	

	

	// ConsoleApplication2-链式栈.cpp : 定义控制台应用程序的入口点。
	//
	
	#include "stdafx.h"
	#include<iostream>
	using namespace std;
	
	
	template<class T>
	class LinkedStack;
	
	template<class T>
	class LinkNode //链表结点类的定义
	{
	public:
	 friend class LinkedStack<T>;
	 LinkNode(LinkNode<T> *nnext = NULL)
	 { next = nnext; }
	 LinkNode(T t, LinkNode<T> *nnext = NULL)
	 { data = t; next = nnext; }
	private:
	 T data;
	 LinkNode<T> *next;
	};
	
	template <class T>
	class LinkedStack
	{
	public:
	 LinkedStack();
	 LinkedStack(int t); //构造一个空栈 S
	 ~LinkedStack(); //销毁已存在的栈S
	 int getStackLength(); //返回 S 的元素个数，即栈的长度
	 bool IsStackEmpty(); //若栈 S 为空栈，则返回 TRUE，否则 FALE
	 bool GetTop(T &t); //用 e 返回 S 的栈顶元素
	 void makeEmpty(); //将 S 清为空栈
	 bool Push(T t); //插入元素 e 为新的栈顶元素
	 bool Pop(T &t); //删除 S 的栈顶元素，并用 e 返回其值
	 void StackTravers(void(*visit)(T e)); //遍历元素
	private:
	 LinkNode<T> *first;
	 int length, maxlength;
	};
	
	template<class T>
	LinkedStack<T>::LinkedStack(int t)
	{
	 first = new LinkNode<T>;
	 length = 0;
	 maxlength = t;
	}
	
	template<class T>
	LinkedStack<T>::~LinkedStack()
	{
	 makeEmpty();
	}
	
	template<class T>
	bool LinkedStack<T>::Push(T t)
	{
	 if (getStackLength()==maxlength)
	 {
	 return false;
	 }
	 else
	 {
	 LinkNode<T> *current;
	 LinkNode<T> *newNode = new LinkNode<T>(t);
	 current = first->next;
	 first->next = newNode;
	 newNode->next = current;
	 length++;
	 return true;
	 }
	}
	
	template<class T>
	int LinkedStack<T>::getStackLength()
	{
	 return length;
	}
	
	template<class T>
	void LinkedStack<T>::makeEmpty()
	{
	 LinkNode<T> *current;
	 while (first->next != NULL) {
	 current = first->next;
	 first->next = current->next;
	 delete current;
	 }
	}
	
	template<class T>
	void LinkedStack<T>::StackTravers(void(*visit)(T e))
	{
	 LinkNode<T>* current = first->next;
	 while (current != NULL)
	 {
	 visit(current->data);
	 current = current->next;
	 }
	}
	
	template<class T>
	bool LinkedStack<T>::GetTop(T &t)
	{
	 LinkNode<T>* current = first->next;
	 if (current==NULL)
	 {
	 return false;
	 }
	 else
	 {
	 t = current->data;
	 return true;
	 }
	}
	
	template<class T>
	bool LinkedStack<T>::IsStackEmpty()
	{
	 if (length==0)
	 {
	 return true;
	 }
	 else
	 {
	 return false;
	 }
	}
	
	template<class T>
	bool LinkedStack<T>::Pop(T &t)
	{
	 if (first->next==NULL)
	 {
	 return false;
	 }
	 else
	 {
	 LinkNode<T> *current;
	 current = first->next;
	 t = current->data;
	 first->next = current->next;
	 delete current;
	 length--;
	 return true;
	 }
	}
	
	void visit(int t)
	{
	 cout << "#_:" << t << endl;
	}
	
	int main()
	{
	 void visit(int t); //声明visit函数，该函数在遍历函数中使用
	 LinkedStack<int> L_1(2);
	 int i = 5,j;
	 L_1.Push(i);
	 L_1.StackTravers(visit);
	 L_1.Push(i+1);
	 L_1.StackTravers(visit);
	 L_1.GetTop(j); cout << j<<endl;
	 L_1.Pop(j); cout << j << endl;
	 L_1.StackTravers(visit);
	 return 0;
	}
评论列表
本站所提供的代码，版权归原作者所有，若有侵犯作者版权，请与我们联系，我们将立即删除或修改。谢谢!
本站所有代码发布及提供者。
试试其它关键字
　链式栈　
同语言下
可能有用的
一男贡献的其它代码(14)