4、元素入栈、出栈顺序的合法性,如入栈的序列为(1,2,3,4,5),出栈序列为(4,5,3,2,1)
思路:借用一个辅助栈来保存出栈序列中的元素
检查过程:
1、检查辅助栈是否为空,为空,则把入栈序列未入栈的元素入栈,不为空则比较辅助栈的栈顶和此时出栈的元素,要是不相等,
则把入栈序列元素依次入栈,直到两个栈的栈顶元素相同为止,此时把辅助栈栈顶元素出栈,并把出队序列指针后移。
2、重复上一步的操作。
3、要是最终使出栈序列对应的栈为空,那么就说明出栈序列是正确的,要是入栈序列的所有元素都入栈,仍不能满足辅助栈栈顶元素
与此时要出栈的元素相同,那么就说明出栈序列是错误
StackAndQueue.h
<strong><span style="font-size:18px;">#pragma once
#include <iostream>
#include <assert.h>
using namespace std;
#include <stack>
template<class T>
class LegalCheck
{
public:
bool IsLegalCheck(T* array1,T* array2,size_t size1,size_t size2)
{
assert(array1);
assert(array2);
size_t j = 0;
if (size1 != size2)
{
return false;
}
else
{
for (size_t i = 0;i < size1; ++i)
{
_instack.push(array1[i]);
if (_instack.top() == array2[j])
{
_instack.pop();
j++;
while (_instack.empty() == false && _instack.top() == array2[j])
{
_instack.pop();
j++;
}
}
}
while (_instack.empty() == false)
{
if (_instack.top() == array2[j])
{
_instack.pop();
j++;
}
else
{
return false;
}
}
if (j == size1)
{
return true;
}
else
{
return false;
}
}
}
private:
stack<T> _instack;
};
</span></strong>
test.cpp
<strong><span style="font-size:18px;">#define _CRT_SECURE_NO_WARNINGS 1
#include "StackAndQueue.h"
void Test4()
{
//元素入栈、出栈顺序的合法性,如入栈的序列为(1,2,3,4,5),出栈序列为(4,5,3,2,1)
LegalCheck<int> legalcheck;
//int InArray[5] = {1,2,3,4,5};
//int OutArray[5] = {4,5,3,2,1};//输出1
//int InArray[] = {1,2,3,4,5,6,7,8,9,10,11};
//int OutArray[] = {2,5,6,9,8,10,7,4,3,11,1};//输出1
int InArray[] = {1,2,3,4,5,6,7,8,9,10,11};
int OutArray[] = {2,5,6,9,8,11,7,4,3,10,1};//输出0
size_t size1 = sizeof(InArray)/sizeof(InArray[0]);
size_t size2 = sizeof(OutArray)/sizeof(OutArray[0]);
cout<<legalcheck.IsLegalCheck(InArray,OutArray,size1,size2)<<endl;
}
int main()
{
Test4();
system("pause");
return 0;
}
</span></strong>