C++倒数第二天

#include <iostream>
using namespace std;
int fun(int len,int i)
{
    if(i >= len)
    {
        throw int(2);
    }
    if(i < len)
    {
        throw int(5);
    }
    return i;
}
int main()
{
    int len = 5,i=8;
    char str[5] = {'a','b','c','d','e'};
    try {
        fun(len,i);
    } catch (int ret) {
        if(ret == 2)
        {
            cout << "数组访问越界！" << endl;
        }
        if(ret == 5)
        {
            cout << str[i] << endl;
        }
    }

    return 0;
}

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

template <typename T>
class seqstack
{
     T *data;
     T top;
     T size;
public:
     //构造函数
     seqstack():size(5)
     {
         data = new T[size];
         top = -1;
         cout << "stack的无参构造" << endl;
     }
     //析构函数
     ~seqstack()
     {
         delete []data;
         cout << "seqstack的析构函数" << endl;
     }
     //判空
     bool stackempty();
     //判满
     bool stackfull();
     //入栈
     void push(T data);
     //出栈
     void pop();
     //遍历
     void show();
};
//判空
template<typename T>
bool seqstack<T>::stackempty()
{
     return (this->top == -1);
}
//判满
template<typename T>
bool seqstack<T>::stackfull()
{
     return (this->top == this->size-1);
}
//入栈
template<typename T>
void seqstack<T>::push(T data)
{
    if(stackfull())
    {
        cout << "栈已满"  << endl;
        return;
    }
    this->top++;
    this->data[this->top] = data;
}
//出栈
template<typename T>
void seqstack<T>::pop()
{
    if(stackempty())
    {
        cout << "栈已空"  << endl;
        return;
    }
    this->top--;
}
//遍历
template<typename T>
void seqstack<T>::show()
{
    if(stackempty())
    {
        cout << "栈已空" << endl;
        return;
    }
    for(int i=0;i<this->top+1;i++)
    {
        cout << this->data[i] << setw(4);
    }
    cout << endl;
}

int main()
{
    seqstack <int>s1;
    cout << s1.stackempty() << endl;

    s1.push(1);
    s1.push(2);
    s1.push(3);
    s1.push(4);
    s1.push(5);
    s1.stackfull();
    s1.show();

    s1.pop();
    s1.pop();
    s1.show();

    return 0;
}