7-1 堆栈操作合法性 (10分)
假设以S和X分别表示入栈和出栈操作。如果根据一个仅由S和X构成的序列,对一个空堆栈进行操作,相应操作均可行(如没有出现删除时栈空)且最后状态也是栈空,则称该序列是合法的堆栈操作序列。请编写程序,输入S和X序列,判断该序列是否合法。
输入格式:
输入第一行给出两个正整数N和M,其中N是待测序列的个数,M(≤50)是堆栈的最大容量。随后N行,每行中给出一个仅由S和X构成的序列。序列保证不为空,且长度不超过100。
输出格式:
对每个序列,在一行中输出YES如果该序列是合法的堆栈操作序列,或NO如果不是。
输入样例:
4 10
SSSXXSXXSX
SSSXXSXXS
SSSSSSSSSSXSSXXXXXXXXXXX
SSSXXSXXX
输出样例:
YES
NO
NO
NO
#include<iostream>
#include<cstdio>
typedef struct Node* NodePoint;
typedef class Stack* StackPoint;
struct Node{
char data;
NodePoint Link;
};
class Stack{
private:
NodePoint head;
NodePoint p;
int StackLength;
int Left;
int Right;
int StackFull;
public:
Stack(){
this->head=NULL;
this->StackLength=0;
this->Left=0;
this->Right=0;
this->StackFull=0;
}
void SetStackFull(int num){
this->StackFull=num;
}
int GetStackFull(){
return this->StackFull;
}
void LeftAdd(){
this->Left++;
}
void RightAdd(){
this->Right++;
}
int GetLeft(){
return this->Left;
}
int GetRight(){
return this->Right;
}
int GetLength(){
return this->StackLength;
}
void StackPush(char data){
NodePoint NewNode=new Node;
NewNode->data=data;
if(this->head==NULL){
NewNode->Link=NULL;
this->head=NewNode;
this->p=NewNode;
} else{
NewNode->Link=this->p;
this->p=NewNode;
}
this->StackLength++;
}
char StackPop(){
if(this->StackLength<=0){
abort();
}
NodePoint DeleteNode;
char data;
DeleteNode=this->p;
data=p->data;
this->p=this->p->Link;
delete (DeleteNode);
this->StackLength--;
return data;
}
};
void PrintNode(StackPoint* s1){
while ((*s1)->GetLength()>0){
std::cout<<(*s1)->StackPop();
}
}
bool Varify2(char data1,StackPoint* s1){
bool stat=true;
int var1=(*s1)->GetStackFull(),var2=(*s1)->GetLength();
if(var1<var2){
stat= false;
return false;
}
if((*s1)->GetLength()<0){
stat= false;
} else if((*s1)->GetLength()==0) {
stat= false;
} else if((*s1)->GetLength()>0){
(*s1)->StackPop();
}
return stat;
}
bool ReadNode(int num2){
bool stat= true;
char data1;
StackPoint s1=new Stack();
s1->SetStackFull(num2);
data1=getchar();
while (data1!='\n'){
if(data1=='S'){
s1->StackPush(data1);
s1->LeftAdd();
}
if(data1=='X'){
s1->RightAdd();
stat=Varify2(data1,&s1);
}
data1=getchar();
}
if(s1->GetLeft()!=s1->GetRight()){
stat= false;
}
return stat;
}
int main(){
int num1,num2;
std::cin>>num1>>num2;
getchar();
for(int i=0;i<num1;i++){
bool stat;
stat=ReadNode(num2);
if(stat== false){
std::cout<<"NO\n";
} else{
std::cout<<"YES\n";
}
}
}