多少分
来源:互联网 发布:java框架书籍知乎 编辑:程序博客网 时间:2024/06/10 20:00
#include <iostream>
#include <cstdio>
#include <stack>
using namespace std;
bool IspopOrder(const int *pPush, const int *pPop, int length){
bool possible = false;
if(pPush != NULL && pPop != NULL &&length > 0){
const int *pNextPush = pPush;
const int *pNextPop = pPop;
stack<int>stackData;
while(pNextPop - pPop < length){
while(stackData.empty() || stackData.top() != *pNextPop){
if(pNextPush - pPush == length){
break;
}
stackData.push(*pNextPush);
pNextPush++;
}
if(stackData.top() != *pNextPop){
break;
}
stackData.pop();
pNextPop++;
}
if(stackData.empty() && pNextPop - pPop == length)
possible = true;
}
return possible;
}
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();
return 0;
}
#include <cstdio>
#include <stack>
using namespace std;
bool IspopOrder(const int *pPush, const int *pPop, int length){
bool possible = false;
if(pPush != NULL && pPop != NULL &&length > 0){
const int *pNextPush = pPush;
const int *pNextPop = pPop;
stack<int>stackData;
while(pNextPop - pPop < length){
while(stackData.empty() || stackData.top() != *pNextPop){
if(pNextPush - pPush == length){
break;
}
stackData.push(*pNextPush);
pNextPush++;
}
if(stackData.top() != *pNextPop){
break;
}
stackData.pop();
pNextPop++;
}
if(stackData.empty() && pNextPop - pPop == length)
possible = true;
}
return possible;
}
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();
return 0;
}
0 0
- 多少分
- 一次评论多少分?
- 民间1分利息多少
- 距离2012还有多少秒?多少分?多少小时?
- 判断两个时间相差多少天多少分多少秒
- 一块钱 1分 2分 5分 有多少种分法
- ios 两个时间之间的比较,相差多少天多少小时多少分多少秒
- php 把多少秒数转化成多少时多少分多少秒
- java计算两个日期间相差多少天多少小时多少分多少秒
- 娱乐,测试女人值多少分书
- 哈空间啊多少分健康打算
- GRE数学多少分适合申请留学?
- csdn多少分可以看到排名!
- 月息1分相当于年华利率多少
- 球队至少需要多少分可以出线,最多有多少分未出线
- java判断2个时间相差多少天、多少小时、多少分
- java判断2个时间相差多少天、多少小时、多少分
- 发布文章时多少天、多少小时、多少分前发布功能
- YTUOJ-手机尾号评分
- ZooKeeper监控
- 目标程序集不包含服务类型。可能需要调整此程序集的代码访问安全策略
- HDU1839Delay Constrained Maximum Capacity Path(二分答案+SPFA)经典
- 3.22
- 多少分
- FFMPEG命令
- Printf函数进栈顺序
- C++Builder 下的多线程介绍
- Linux使用技巧9--用dpkg管理你的软件
- 第五周程序阅读
- Linked List Cycle--LeetCode
- c#实现画图功能
- git 命令锦集