1057 Stack

最新推荐文章于 2023-11-26 17:09:54 发布

三块不一样的石头

最新推荐文章于 2023-11-26 17:09:54 发布

阅读量310

点赞数

分类专栏： PAT (Advanced Level) Practice 文章标签：算法 PTA

本文链接：https://blog.csdn.net/daybreak_alonely/article/details/127971317

版权

PAT (Advanced Level) Practice 专栏收录该内容

59 篇文章 1 订阅

订阅专栏

Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Push (inserting an element onto the top position) and Pop (deleting the top element). Now you are supposed to implement a stack with an extra operation: PeekMedian -- return the median value of all the elements in the stack. With N elements, the median value is defined to be the (N/2)-th smallest element if N is even, or ((N+1)/2)-th if N is odd.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (≤105). Then N lines follow, each contains a command in one of the following 3 formats:

Push key
Pop
PeekMedian

where key is a positive integer no more than 105.

Output Specification:

For each Push command, insert key into the stack and output nothing. For each Pop or PeekMedian command, print in a line the corresponding returned value. If the command is invalid, print Invalid instead.

Sample Input:

17
Pop
PeekMedian
Push 3
PeekMedian
Push 2
PeekMedian
Push 1
PeekMedian
Pop
Pop
Push 5
Push 4
PeekMedian
Pop
Pop
Pop
Pop

Sample Output:

Invalid
Invalid
3
2
2
1
2
4
4
5
3
Invalid

题目大意

标准栈操作，只不过多了 “查询栈里边所有元素的中位数”;

思路

额外设置一个动态数组(vector)存储当前所有元素的排序

C/C++ （自己实现了二分查找）

//#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<stack>
using namespace std;
int findMid(const vector<int>& box,int num){
    int head=0,tail=box.size()-1;
    while (head<=tail){
        int mid = (head+tail)/2;
        if(box[mid]==num) return mid;
        else if(box[mid]<num) head = mid+1;
        else tail = mid-1;
    }
    return -1;
}
int findMin(const vector<int>& box,int num){
    int head=0,tail=box.size()-1;
    while (head<=tail){
        int mid = (head+tail)/2;
        if(box[mid]<num) head = mid+1;
        else tail = mid-1;
    }
    return head;
}
    int main()
{
    vector<int> key;
    vector<int> ::iterator flag;
    stack<int> box;
    string s;
    int N,num;
    cin >> N;
    while (N--){
        cin >> s;
        if(s=="Push"){
            cin >> num;
            int op = findMin(key,num);
            key.insert(key.begin()+op,num);
            box.push(num);
        }
        else if(s=="Pop"){
            if(box.empty()) puts("Invalid");
            else
            {
                num = box.top();
                int op = findMid(key,num);
                key.erase(key.begin()+op);
                box.pop();
                cout << num << endl;
            }
        }
        else
        {
            if(box.empty()) puts("Invalid");
            else if(box.size()%2==0) cout << key[(box.size()-1)/2] << endl;
            else cout << key[(box.size())/2] << endl;
        }
    }

    return 0;
}

C/C++ （内置函数二分查找）


#include<bits/stdc++.h>
using namespace std;
int main()
{
    vector<int> key;
    vector<int> ::iterator flag;
    stack<int> box;
    string s;
    int N,num;
    cin >> N;
    while (N--){
        cin >> s;
        if(s=="Push"){
            cin >> num;
            flag = lower_bound(key.begin(), key.end(),num);
            key.insert(flag,num);
            box.push(num);
        }
        else if(s=="Pop"){
            if(box.empty()) puts("Invalid");
            else
            {
                num = box.top();
                flag = lower_bound(key.begin(),key.end(),num);
                key.erase(flag);
                box.pop();
                cout << num << endl;
            }
        }
        else
        {
            if(box.empty()) puts("Invalid");
            else if(box.size()%2==0) cout << key[(box.size()-1)/2] << endl;
            else cout << key[(box.size())/2] << endl;
        }
    }

    return 0;
}