C++模板

初步学习了C++的模板用法（泛型编程的基础）

#include <iostream>
#include <ctime>
#include <string>
#include <vector>
#include <cstdlib>
#include <stdexcept>
#include <fstream>
#include <csignal>
#include <unistd.h>
#include "head.h"
using namespace std;

#define MIN(a,b) (a<b ? a:b)

const string root_path = "C:\\Users\\zhaols\\Desktop\\";

template <typename T>
inline T const& Max(T const& a, T const& b)
{
    return a < b ? b:a;
}

template <class T>
class Stack {
    private:
    vector<T> elems; //元素
    public:
    void push(T const&); //入栈
    void pop();          //出栈
    T top() const;      //返回栈顶元素
    bool empty() const {       //如果为空返回真
        return elems.empty();
    }

};
template <class T>
void Stack<T>:: push(T const& elem)
{
    //追加传入元素的副本
    elems.push_back(elem);
}

template <class T>
void Stack<T>::pop()
{
    if(elems.empty()) 
    {
        throw out_of_range("Stack<>::pop(): empty stack");
    }
    //删除最后一个元素
    elems.pop_back();
}

template <class T>
T Stack<T>::top() const
{
    if(elems.empty())
    {
        throw out_of_range("Stack<>::top(): empty stack");
    }
    //返回最后一个元素的副本
    return elems.back();
}
int main()
{
    try {
        Stack<int> intStack;
        Stack<string> stringStack;

        //操作int类型的栈
        intStack.push(7);
        cout<<intStack.top()<<endl;

        //操作string类型的栈
        stringStack.push("hello");
        cout<<stringStack.top()<<std::endl;
        stringStack.pop();
        stringStack.pop();
    }
    catch (exception const& ex) {
        cerr<<"Exception:"<<ex.what()<<endl;
        return -1;
    }
    return 0;
}