oral_quiz->#IsPopOrder#

#include <stdio.h>
#include <stack>
#include <exception>

bool MyIsPopOrder(int* InSeq, int* OutSeq, int length) {
	if(InSeq == NULL || OutSeq == NULL || length <= 0)
		return false;

	std::stack<int> stackAid;

	int index = 0;
	for(int i=0; i<length; ++i) {
		if(!stackAid.empty() && OutSeq[i] == stackAid.top()) {
			stackAid.pop();
			continue;
		}
		while(index < length && InSeq[index] != OutSeq[i]) {
			stackAid.push(InSeq[index++]);
		}
		//push
		if(index < length && InSeq[index] == OutSeq[i])
			stackAid.push(InSeq[index]);
		if(!stackAid.empty() && OutSeq[i] != stackAid.top() && index >= length)
			return false;
		//pop
		if(index < length && InSeq[index] == OutSeq[i]) {
			stackAid.pop();
			++index;
		}
	}

	return true;
}

//============================hht's=========================
bool IsPopOrder(const int* pPush, const int* pPop, int nLength) {
	bool bPossible = false;

	if(pPush != NULL && pPop != NULL && nLength > 0) {
		const int* pNextPush = pPush;
		const int* pNextPop = pPop;

		std::stack<int> stackData;

		while(pNextPop - pPop < nLength) {
			while(stackData.empty() || stackData.top() != *pNextPop) {
				if(pNextPush - pPush == nLength)
					break;

				stackData.push(*pNextPush);
				++pNextPush;
			}

			if(stackData.top() != *pNextPop)
				break;

			stackData.pop();
			++pNextPop;
		}

		if(stackData.empty() && pNextPop - pPop == nLength)
			bPossible = true;
	}

	return bPossible;
}

void Test(const char* testName, int* InSeq, int* OutSeq, int length, bool expected) {
	if(testName != NULL)
		printf("%s begins: \n", testName);
//	if(expected == MyIsPopOrder(InSeq, OutSeq, length))
	if(expected == IsPopOrder(InSeq, OutSeq, length))
		printf("passed.\n");
	else
		printf("failed.\n");
}

//***********multi number***************
//1.yes
void Test1() {
	int InSeq[] = {1,2,3,4,5};
	int OutSeq[] = {3,5,4,2,1};
	Test("Test1", InSeq, OutSeq, 5, true);
}
//2.no
void Test2() {
	int InSeq[] = {1,2,3,4,5};
	int OutSeq[] = {4,3,5,1,2};
	Test("Test2", InSeq, OutSeq, 5, false);
}

//***********single number***************
//1.yes
void Test3() {
	int InSeq[] = {2};
	int OutSeq[] = {2};
	Test("Test3", InSeq, OutSeq, 1, true);
}
//2.no
void Test4() {
	int InSeq[] = {5};
	int OutSeq[] = {4};
	Test("Test4", InSeq, OutSeq, 1, false);
}

//NULL
void Test5() {
	Test("Test5", NULL, NULL, 0, false);
}

int main(int argc, char* argv[]) {
	Test1();
	Test2();
	Test3();
	Test4();
	Test5();

	return 0;
}



转载于:https://my.oschina.net/ITHaozi/blog/279906

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值