C++day6

模板类实现封装栈

#include 
#define MAX 128
using namespace std;

template 
class Stack
{
private:
    T *p = new T[MAX];//存放数据的数组
    int top;//记录下标位置

public:
    //构造函数
    Stack()
    {
        top = -1;
        cout<<"无参构造函数"<
int Stack::stack_size()
{
    cout<<"栈的大小为 "<
T Stack::stack_top()
{
    if(stack_empty())
    {
        cout<<"获取失败"<
int Stack::stack_full()
{
    return top == MAX-1;

}
//判空
template 
int Stack::stack_empty()
{
    return top == -1;
}
//清空栈
template 
void Stack::stack_free()
{
    while(top != -1)
    {
        stack_pop();
    }
    cout<<"清空成功"<
bool Stack::stack_pop()
{
    if(stack_empty())
    {
        return false;
    }
    T e = p[top];

    top--;
    cout<
bool Stack::stack_push(T e)
{
    if(stack_full())
    {
        cout<<"入栈失败"< s1;
    s1.stack_push(4);
    Stack s3 = s1;
    s3.stack_pop();
    s3.stack_size();
    s1.stack_pop();
    Stack s2;
    s2.stack_push("hello");
    s2.stack_pop();

    return 0;
}

 

模板类封装队列

#include 
#define MAX 128
using namespace std;
template
class Queue_q
{
private:
    T *p=new T[MAX];//队列的数组
    int tail;//记录队尾元素
    int head;//记录对头元素
public:
    //构造函数
    Queue_q(int t=0)
    {
        head=t;
        tail=t;
        cout<<"无参构造函数"<
int Queue_q::queue_push(T e)
{
    if(queue_full())
    {
        cout<<"入队失败"<
int Queue_q::queue_pop()
{
    if(queue_empty())
    {
        cout<<"出队失败"<
int Queue_q::queue_delete()
{
    while(head!=tail)
    {
        queue_pop();
    }
    delete [] p;
    p=nullptr;
    cout<<"清空队列成功"<
bool Queue_q::queue_empty()
{
    if(head==tail)
    {
        cout<<"队列空"<
bool Queue_q::queue_full()
{
    if((tail+1)==0)
    {
        cout<<"队列满了"<
void Queue_q::queue_getsize()
{
    int size;
    size=(tail-head+MAX)%MAX;
    cout<<"队的大小为："< q1;
    double e;
    int s;
    q1.queue_empty();
    cout<<"请输入要入队的个数：";
    cin>>s;
    for(int i=0;i>e;
        q1.queue_push(e);
    }
     q1.queue_getsize();
    for(int i=0;i q2;
    string e1;
    int s2;
    q2.queue_empty();
    cout<<"请输入要入队的个数：";
    cin>>s2;
    for(int j=0;j>e1;
        q2.queue_push(e1);
    }
     q2.queue_getsize();
    for(int j=0;j q3 = q2;
    return 0;

}