MyUtil.h:
#pragma once
#include <algorithm>
//用来将数组放大一倍
template <class T>
void ChangeSize1D(T *a, const int oldSize, const int newSize)
{
if (newSize < 0)
{
throw "New length must be >= 0";
}
T* temp = new T[newSize];
int number = std::min(oldSize, newSize);
std::copy(a, a + number, temp);
delete[] a;
a = temp;
}
MyStack.h:
#pragma once
#include "MyUtil.h"
template<class T>
class MyStack
{
public:
//构造函数,默认大小为10
MyStack(int stackCapacity = 10);
~MyStack();
public:
//判断站是否为空
bool IsEmpty() const;
//返回栈顶的元素,不删除--peek
T& Top() const;
//入栈
void Push(const T& item);
//删除栈顶的元素
void Pop();
private:
//用于动态创建一个数组
T *stack;
//用来记录栈顶在哪里
int top;
//数组多大
int capacity;
};
//构造函数,默认大小为10
template<class T>
MyStack<T>::MyStack(int stackCapacity = 10) :capacity(stackCapacity)
{
if (capacity < 1)
{
throw "stack capacity must be >0";
}
stack = new T[stackCapacity];
top = -1;//初始的时候栈顶top没有值,给个-1
}
template<class T>
MyStack<T>::~MyStack()
{
delete[] stack;
}
//判断站是否为空
template<class T>
inline bool MyStack<T>::IsEmpty() const
{
//if (top == -1)
//{
// return false;
//}
return top == -1;
}
//返回栈顶的元素,不删除--peek
template<class T>
inline T& MyStack<T>::Top() const
{
if (IsEmpty())
{
throw "Stack is empty";
}
return stack[top];
}
//入栈
template<class T>
void MyStack<T>::Push(const T& item)
{
//判断数组是否已经被塞满元素,如果是,则调用扩张函数
if (top == capacity - 1)
{
ChangeSize1D(stack, capacity, 2 * capacity);
capacity *= 2;
}
stack[++top] = item;
}
//删除栈顶的元素
template<class T>
void MyStack<T>::Pop()
{
if (IsEmpty())
{
throw "Stack is empty, cannot delete";
}
stack[top--].~T();
}
Main.cpp:
#include <iostream>
#include "MyStack.h"
using namespace std;
class Dog
{
public:
Dog()
{
}
~Dog()
{
}
private:
string name;
int age;
};
int main()
{
MyStack<int> st;
st.Push(99);
st.Push(22);
st.Push(18);
st.Push(67);
st.Pop();
cout << st.Top() << endl;
st.Pop();
cout << st.Top() << endl;
st.Pop();
cout << st.Top() << endl;
MyStack<Dog> dogStack;
MyStack<string> stringStack;
return 0;
}