4/2 C++_day6

#include <iostream>
#include <cstring>

using namespace std;



int fun(char *arr,unsigned int n)
{
    if(n > (strlen(arr)-1))
    {
        throw int(0);
    }
    cout << arr[n] << endl;
    return arr[n];
}




int main()
{
    char arr[6] = "hello";

    try
    {
        fun(arr,4);
        fun(arr,6);
        fun(arr,1);
    }
    catch (int)
    {
        cout << "数组访问越界" << endl;
    }

    cout << "hello world" << endl;
    return 0;
}

#include <iostream>
#define Max 100

using namespace std;
template <typename T>
class SeqStack
{
private:

    T data[Max];
    int top;

public:
    SeqStack():top(-1){}

    //判空
    bool Empty()
    {
        return top == -1;
    }

    //判满
    bool Full()
    {
        return top == Max - 1;
    }


    //入栈
    void push(T x)
    {
        if (Full())
        {
            return;
        }
        top++;
        data[top] = x;
    }

    //出栈
    void pop()
    {
        if (Empty())
        {
            return;
        }
        cout << "出栈的元素为:" << data[top] << endl;
        top--;
    }

    //清空
    void clean()
    {
        if(Empty())
        {
            return;
        }
        top = -1;
    }

    //查看顺序栈
    void show()
    {
        for(int i = 0;i <= top;i++)
        {
            cout << data[i] << "->";
        }
        cout << endl;
    }
    //销毁

};
int main()
{
    SeqStack <int>s1;
    s1.push(3);
    s1.push(6);
    s1.push(7);
    s1.show();
    cout << "---------------" << endl;
    s1.pop();
    s1.show();
    cout << "---------------" << endl;
    s1.pop();
    s1.show();
    cout << "---------------" << endl;
    s1.clean();
    s1.show();

    return 0;
}