資源簡介
判斷一個字符串是否是中心對稱 C++描述
代碼片段和文件信息
#include
using?namespace?std;
int?const?MAXSIZE=50;
int?num;
template?
struct?Node
{
????T?data;
????Node?*next;
};
template?
class?SeqStack
{
private:
????T?data[MAXSIZE];
????int?top;
public:
????SeqStack()
????{
????????top=-1;
????}
????void?Push(T?x);
????T?Top();
};
template?
void?SeqStack::Push(T?x)
{
????if(top==MAXSIZE-1)?throw“上溢“;
????else
????{
????????top++;
????????data[top]=x;
????}
}
template?
T?SeqStack::Top()
{
????if(top!=-1)
????return(data[top--]);
}
template?
class?linklist
{
private:
????Node?*head;
public:
????linklist();
????void?put(SeqStack?a);
????void?show();
};
template?
linklist::linklist()
{
????cout<<“請輸入鏈表數據,以?$?結束“< ????T?a;
????num=0;
????Node?*s*r;
????head=new?Node;
????head=NULL;
????r=NULL;
????cin>>a;
????while(a!=‘$‘)
????{
????????s=new?Node;
????????s->
- 上一篇:segy讀取原碼
- 下一篇:基于QT的黑白棋游戲
評論
共有 條評論