C++ stack::pop()实例讲解

原型：

    stack<T> st; //declaration
    st.pop();

参数：

    No parameter passed

返回类型：空白

要包含的头文件：

    #include <iostream>
    #include <stack>
    OR
    #include <bits/stdc++.h>

用法：

该函数从堆栈中弹出顶部元素。

时间复杂度：O(1)

例：

    For a stack of integer,
    stack<int> st;
    st.push(4);
    st.push(5);
    stack content:
    5 <-- TOP
    4

    st.pop(); //one pop operation performed
    stack content:
    4 <-- TOP

    st.pop();  //one pop operation performed
    stack content:
    empty stack

C++ 实现：

#include <bits/stdc++.h>
using namespace std;

int main(){
    cout<<"...use of pop function...\n";
    int count=0;
    stack<int> st; //declare the stack
    st.push(4); //pushed 4
    st.push(5); //pushed 5
    st.push(6);
    
    cout<<"stack elements are:\n";
    while(!st.empty()){//stack not empty
        cout<<"top element is:"<<st.top()<<endl;//print top element
        st.pop();
        count++;
    }
    cout<<"stack empty\n";
    cout<<count<<" pop operation performed total to make stack empty\n";
	
    return 0;   
}

输出

...use of pop function...
stack elements are:
top element is:6
top element is:5
top element is:4
stack empty
3 pop operation performed total to make stack empty