关闭

02-线性结构3 Pop Sequence

264人阅读 评论(0) 收藏 举报
分类:

Given a stack which can keep MM numbers at most. Push NN numbers in the order of 1, 2, 3, …, NN and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, if MM is 5 and NN is 7, we can obtain 1, 2, 3, 4, 5, 6, 7 from the stack, but not 3, 2, 1, 7, 5, 6, 4.
Input Specification:

Each input file contains one test case. For each case, the first line contains 3 numbers (all no more than 1000): MM (the maximum capacity of the stack), NN (the length of push sequence), and KK (the number of pop sequences to be checked). Then KK lines follow, each contains a pop sequence of NN numbers. All the numbers in a line are separated by a space.
Output Specification:

For each pop sequence, print in one line “YES” if it is indeed a possible pop sequence of the stack, or “NO” if not.
Sample Input:

5 7 5
1 2 3 4 5 6 7
3 2 1 7 5 6 4
7 6 5 4 3 2 1
5 6 4 3 7 2 1
1 7 6 5 4 3 2
Sample Output:

YES
NO
NO
YES
NO

问题描述:把1-N个数依次进栈,给出出栈的结果,判断是否可能有这种出栈方式。

思路:当大的数pop出来的时候,小的数肯定已经进去了,所以模拟这一过程,若按照输入的序列不会爆栈,则这种情况是可能的,否则就不可能。

#include <iostream>
#include <stack>

using namespace std;

void input()
{
    int stack_capacity, input_num, input_line;
    stack<int> st;
    cin >> stack_capacity;
    cin >> input_num;
    cin >> input_line;

    int* temp = new int[input_num];
    int* ifpossible = new int[input_line];

    for (int i = 0; i < input_line; i++)
    {
        ifpossible[i] = 1;
        int k = 1;
        for (int j = 0; j<input_num;j++)
        {
            cin >> temp[j];

            while (st.size() <= stack_capacity)
            {
                if (st.empty() || st.top() != temp[j])
                {
                    st.push(k++);
                }
                else if (st.top() == temp[j])
                {
                    st.pop();
                    break;
                }

            }
            if (st.size() > stack_capacity)
            {
                ifpossible[i] = 0;
            }

        }
        while (!st.empty())
            st.pop();

    }

    for (int i = 0; i < input_line; i++)
    {
        if (ifpossible[i] == 0)
            cout << "NO" << endl;
        else
            cout << "YES" << endl;
    }
delete[]temp;
delete[]ifpossible;
}

int main()
{
    input();

    return 0;
}
0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

02-线性结构1 两个有序链表序列的合并 (15分)

本题要求实现一个函数,将两个链表表示的递增整数序列合并为一个递增的整数序列。 函数接口定义:List Merge( List L1, List L2 );其中List结构定义如下:typedef s...
  • wanmeiwushang
  • wanmeiwushang
  • 2016-09-19 14:11
  • 3857

02-线性结构2 一元多项式的乘法与加法运算 (20分)

设计函数分别求两个一元多项式的乘积与和。 输入格式:输入分2行,每行分别先给出多项式非零项的个数,再以指数递降方式输入一个多项式非零项系数和指数(绝对值均为不超过1000的整数)。数字间以空格分隔。...
  • wanmeiwushang
  • wanmeiwushang
  • 2016-09-22 18:43
  • 3962

02-线性结构3. 求前缀表达式的值(25)

/* 求前缀表达式的值 pat Mooc ds by zhoudaxia */ #include #include //栈的基本操作 typedef struct node *Stack; typ...
  • whzyb1991
  • whzyb1991
  • 2015-03-13 09:06
  • 1904

02-线性结构3. Pop Sequence

Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and p...
  • qq_22902423
  • qq_22902423
  • 2015-04-22 23:03
  • 259

PAT 02-线性结构3. Pop Sequence (25)

http://www.patest.cn/contests/mooc-ds2015spring/02-%E7%BA%BF%E6%80%A7%E7%BB%93%E6%9E%843 Given a st...
  • qq_19672579
  • qq_19672579
  • 2015-03-25 21:30
  • 922

02-线性结构3 Pop Sequence

出栈顺序判断
  • u014376961
  • u014376961
  • 2016-07-29 15:32
  • 136

02-线性结构3. Pop Sequence (25)

设置一个变量tmp,由1开始自增。当栈顶元素与输入的元素不匹配时将当前tmp入栈并tmp自加,当匹配时栈顶出栈。 来源:::http://blog.csdn.net/sup_heaven/artic...
  • u010728507
  • u010728507
  • 2015-03-28 21:18
  • 366

数据结构 PAT 02-线性结构3 Pop Sequence

02-线性结构3 Pop Sequence Given a stack which can keep M numbers at most. Push N numbers in t...
  • cs_hmyy
  • cs_hmyy
  • 2015-09-30 20:13
  • 261

[pta]02-线性结构4 Pop Sequence

02-线性结构4 Pop Sequence (25分)Given a stack which can keep MMM numbers at most. Push NNN numbers in t...
  • Gold_Experience
  • Gold_Experience
  • 2017-03-13 10:48
  • 201

02-线性结构4 Pop Sequence (25分)

Given a stack which can keep MMM numbers at most. Push NNN numbers in the order of 1, 2, 3, …, NNN a...
  • wanmeiwushang
  • wanmeiwushang
  • 2016-09-30 20:29
  • 851
    个人资料
    • 访问:14683次
    • 积分:411
    • 等级:
    • 排名:千里之外
    • 原创:26篇
    • 转载:0篇
    • 译文:0篇
    • 评论:2条
    文章分类
    最新评论