c++函数模板二栈实现

1 没有使用模板的栈实现

#include <iostream>
#include <string>
using namespace std;


class Stack
{
public:
    Stack(int size = 1024);
    ~Stack();
    bool isEmpty();
    bool isFull();
    void push(int data);
    int pop();
private:
    int* space;
    int top;

};

Stack::Stack(int size)
{
    space = new int(size);
    top = 0;
}
Stack::~Stack()
{
    delete[]space;
}
bool Stack::isEmpty()
{
    return top == 0;
}
bool Stack::isFull()
{
    return top == 1024;
}
void Stack::push(int data)
{
    space[top++] = data;
}
int Stack::pop()
{
    return space[--top];
}

int main()
{
    Stack s(100);
    int i = 0;
    /*if (!s.isFull())
    {
        s.push(10);
    }*/
    while (!s.isFull()&&i<1024)
    {
        s.push(i);
        i+=10;
    }
    i = 0;
    while (!s.isEmpty()&&i<1024)
    {
        cout << s.pop() << endl;
        i += 10;
    }
    cin.get();
    return 1;
}

2 使用模板以后的栈实现

#include <iostream>
#include <string>
using namespace std;

template<typename T>
class Stack
{
public:
    Stack(int size)
    {
        space = new T[size];
        top = 0;
    }
    ~Stack();
    bool isEmpty();
    bool isFull();
    void push(T data);
    T pop();
private:
    T* space;
    int top;

};

template<typename T>
Stack<T>::~Stack()
{
    delete[]space;
}
template<typename T>
bool Stack<T>::isEmpty()
{
    return top == 0;
}
template<typename T>
bool Stack<T>::isFull()
{
    return top == 1024;
}
template<typename T>
void Stack<T>::push(T data)
{
    space[top++] = data;
}
template<typename T>
T Stack<T>::pop()
{
    return space[--top];
}

int main()
{
    Stack<double> s(100);
    if (!s.isFull())
        s.push(10.4);
    if (!s.isFull())
        s.push(10.5);
    if (!s.isFull())
        s.push(10.6);
    if (!s.isFull())
        s.push(10.7);
    if (!s.isFull())
        s.push(10.8);
    if (!s.isFull())
        s.push(10.9);

    Stack<string> s1(100);
    if (!s1.isFull())
        s1.push("ni");
    if (!s1.isFull())
        s1.push("hao");
    
    while (!s1.isEmpty())
    {
        cout << s1.pop() << endl;
    
    }
    cin.get();
    return 1;
}

可以其他类型可以自己多敲敲哦