元素出入栈的合法性——栈和队列面试题（4）

来源：互联网发布：联通数据卡流量查询编辑：程序博客网时间：2024/04/30 08:58

题目要求：元素的出，入栈顺序的合法性。如入栈{1,2,3,4,5,},出栈{4,5,3,2,1}

"test.cpp"

<strong><span style="font-size:18px;">#include<iostream>using namespace std;#include<assert.h>#include<stack>bool IsLegalOrder(int* arr1,int size1,int* arr2,int size2){assert(arr1);assert(arr2); stack<int> s;int j = 0;for(int i = 0;i < size1;i++){if(arr1[i] != arr2[j]){s.push(arr1[i]);}else{j++;}while(!s.empty() && s.top() == arr2[j]){s.pop();j++;}}if(j == size2){return true;}return false;}void test(){int arr1[] = {1,2,3,4,5};size_t size1 = sizeof(arr1)/sizeof(arr1[0]);//int arr2[] = {4,5,3,2,1};  //yes//int arr2[] = {2,4,5,3,1};  //yes//int arr2[] = {5,4,3,2,1};  //yesint arr2[] = {1,2,5,3,4};  //nosize_t size2 = sizeof(arr2)/sizeof(arr2[0]);bool ret = IsLegalOrder(arr1,size1,arr2,size2);if(ret){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}}int main(){test();return 0;}</span></strong>

0 0