顺序栈
来源:互联网 发布:网络认识了你歌曲下载 编辑:程序博客网 时间:2024/04/28 18:12
#include<iostream>
#include<list>
#include<assert.h>
using namespace std;
template<typename T>
class SqStack
{
private:
T *base,*top;
int stacksize;
public:
SqStack(int k=1)
{
base = new T[k];
assert(base!=NULL);
top = base;
stacksize = k;
}
~SqStack()
{
delete []base;
}
bool push(T e)
{
T *newbase;
if(top-base == stacksize)
{
newbase = new T[stacksize*2];
if(newbase == NULL)
{
return false;
}
for(int j=0;j<top-base;j++)
{
*(newbase+j) = *(base+j);
}
delete[]base;
top = base+stacksize;
stacksize *=2;
}
*top++ = e;
return true;
}
bool Pop(T &e)
{
if(top == base)
{
return false;
}
e = *--top;
return true;
}
bool empty()
{
return top == base;
}
int length()const
{
return top-base;
}
void Clear()
{
top = base;
}
};
typedef int T;
int main()
{
SqStack<T> sq(3);
sq.push(1);
sq.push(2);
return 0;
}
#include<list>
#include<assert.h>
using namespace std;
template<typename T>
class SqStack
{
private:
T *base,*top;
int stacksize;
public:
SqStack(int k=1)
{
base = new T[k];
assert(base!=NULL);
top = base;
stacksize = k;
}
~SqStack()
{
delete []base;
}
bool push(T e)
{
T *newbase;
if(top-base == stacksize)
{
newbase = new T[stacksize*2];
if(newbase == NULL)
{
return false;
}
for(int j=0;j<top-base;j++)
{
*(newbase+j) = *(base+j);
}
delete[]base;
top = base+stacksize;
stacksize *=2;
}
*top++ = e;
return true;
}
bool Pop(T &e)
{
if(top == base)
{
return false;
}
e = *--top;
return true;
}
bool empty()
{
return top == base;
}
int length()const
{
return top-base;
}
void Clear()
{
top = base;
}
};
typedef int T;
int main()
{
SqStack<T> sq(3);
sq.push(1);
sq.push(2);
return 0;
}
0 0
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- 顺序栈
- MFC PNG作背景 透明边框GDI+
- iOS APP上线全流程(最详解析)
- 单例模式中的饿汉式与懒汉式
- 正则表达式不区分大小写以及解决思路的探索 .
- CentOS下Mysql数据库的安装与配置
- 顺序栈
- Oracle 11G在用EXP 导出时,空表不能导出解决
- js实现键盘操作实现div的移动或改变的原理及代码
- 目录
- OpenSMTP,解决中文名称附件不能发送的问题
- iOS 真机调试 (碉堡了)
- LeetCode——Single Number
- 并查集
- 数据库设计三大范式详解(简单易懂)