C++ 判断栈的弹出序列是否正确

题目:

给出一个栈的压入序列,判断给出的弹出序列是否正确。

代码如下:

#include <iostream>
#include <stdio.h>
#include <stack>
using namespace std;
bool IsPopOrder(const int* push_order,const int* pop_order,int length)
{
	if( push_order == NULL || pop_order == NULL || length < 1)
		return false;
	stack <int> data;
	int i = 0 , j =0;
	while( i < length)
	{
		data.push(push_order[i]);
		if(pop_order[j] == data.top())
		{
			data.pop();
			j++;
		}
		i++;
	}
	if(data.size() == 0)
		return true;
	while(!data.empty())
	{
		if(data.top() == pop_order[j])
		{
			data.pop();
			j++;
		}
		else
			return false;
	}
	return true;
}
void Test(char* testName, const int* pPush, const int* pPop, int nLength, bool expected)  
{  
    if(testName != NULL)  
        printf("%s begins: ", testName);  
  
    if(IsPopOrder(pPush, pPop, nLength) == expected)  
        printf("Passed.\n");  
    else  
        printf("failed.\n");  
}  
  
void Test1()  
{  
    const int nLength = 5;  
    int push[nLength] = {1, 2, 3, 4, 5};  
    int pop[nLength] = {4, 5, 3, 2, 1};  
      
    Test("Test1", push, pop, nLength, true);  
}  
  
void Test2()  
{  
    const int nLength = 5;  
    int push[nLength] = {1, 2, 3, 4, 5};  
    int pop[nLength] = {3, 5, 4, 2, 1};  
      
    Test("Test2", push, pop, nLength, true);  
}  
  
void Test3()  
{  
    const int nLength = 5;  
    int push[nLength] = {1, 2, 3, 4, 5};  
    int pop[nLength] = {4, 3, 5, 1, 2};  
      
    Test("Test3", push, pop, nLength, false);  
}  
  
void Test4()  
{  
    const int nLength = 5;  
    int push[nLength] = {1, 2, 3, 4, 5};  
    int pop[nLength] = {3, 5, 4, 1, 2};  
      
    Test("Test4", push, pop, nLength, false);  
}  
  
// push和pop序列只有一个数字  
void Test5()  
{  
    const int nLength = 1;  
    int push[nLength] = {1};  
    int pop[nLength] = {2};  
  
    Test("Test5", push, pop, nLength, false);  
}  
  
void Test6()  
{  
    const int nLength = 1;  
    int push[nLength] = {1};  
    int pop[nLength] = {1};  
  
    Test("Test6", push, pop, nLength, true);  
}  
  
void Test7()  
{  
    Test("Test7", NULL, NULL, 0, false);  
}  
   
int main()  
{  
    Test1();  
    Test2();  
    Test3();  
    Test4();  
    Test5();  
    Test6();  
    Test7();  
	system("PAUSE");
    return 0;  
}  


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值