#include <iostream>
class Queue : private LinkList
{
public:
void Enter(DATA data)
{
push_back(data);
}
void Quit()
{
erase(0);
}
DATA* GetHead()
{
return Get(0);
}
int Length()
{
return LinkList::Length();
}
void Clear()
{
return LinkList::Clear();
}
};
class Stack : private SXB
{
public:
//入栈
void Push(DATA data)
{
push_back(data);
}
//出栈
void Pop()
{
int len = Length();
if (len != 0)
Erase(len-1);
}
bool GetTop(DATA* d)
{
int len = Length();
if (len != 0)
{
*d = *Get(len-1);
return true;
}
return false;
}
void Clear()
{
SXB::Clear();
}
bool Empty()
{
int len = Length();
return len == 0;
}
};
void main()
{
system("pause");
}
类:队列
猜你喜欢
转载自blog.csdn.net/weixin_43374319/article/details/83869731
今日推荐
周排行