February 3rd Tuesday 2009 (二月　三日　火曜日)

最新推荐文章于 2025-11-08 15:54:12 发布

原创最新推荐文章于 2025-11-08 15:54:12 发布 · 504 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#null #class #delete

本文介绍了一个使用C++模板实现的栈数据结构。该栈通过链表的方式进行元素的存储和管理，并提供了基本的栈操作如压栈(push)和出栈(pop)。文章通过一个简单的字符栈实例展示了如何使用这个自定义栈。

//stack.cpp
#include <iostream>

using namespace std;

template <class T> class Stack_Frame {
private:
 Stack_Frame *next;
 T content;
public:
 Stack_Frame() {
 next = NULL;
 }

 Stack_Frame(const T& obj) {
 content = obj;
 this->next = NULL;
 }

 T getContent() { return content; }
 void setContent(T& t) { content = t; }

 Stack_Frame *getNext() { return next; }
 void setNext(Stack_Frame *p) { next = p; }
};

template <class U> class Stack{
 private:
 Stack_Frame *top;
 public:
 Stack() {
 top = NULL;
 }

 ~Stack() {
 Stack_Frame *p = NULL;
 Stack_Frame *q = NULL;

 if (top) {
 for (p = top; p; ) {
 q = p;
 p = p->getNext();
 delete q;
 }
 }

 top = NULL;
 }

 void push(U obj) {
 Stack_Frame* pframe = new Stack_Frame(obj);
 pframe->setNext(top);
 top = pframe;
 }

 void pop(U *p) {
 Stack_Frame* pframe = NULL;

 if (top) {
 pframe = top;
 top = top->getNext();

 (*p) = pframe->getContent();
 }
 }
};

int main() {
 char ch;
 Stack<char> cstack;

 for (ch = 'a'; ch <= 'z'; ch++) {
 cstack.push(ch);
 }

 ch = 0;
 for (int i = 0; i < 26; i++) {
 cstack.pop(&ch);
 cout<<ch<<" ";
 }
 cout<<endl;

 return 0;
}