Modify the top element in a stack : stack « queue stack « C++ Tutorial






/* The following code example is taken from the book
 * "The C++ Standard Library - A Tutorial and Reference"
 * by Nicolai M. Josuttis, Addison-Wesley, 1999
 *
 * (C) Copyright Nicolai M. Josuttis 1999.
 * Permission to copy, use, modify, sell and distribute this software
 * is granted provided this copyright notice appears in all copies.
 * This software is provided "as is" without express or implied
 * warranty, and with no claim as to its suitability for any purpose.
 */
#include <iostream>
#include <stack>
using namespace std;

int main()
{
    stack<int> st;

    // push three elements into the stack
    st.push(1);
    st.push(2);
    st.push(3);

    // pop and print two elements from the stack
    cout << st.top() << ' ';
    st.pop();
    cout << st.top() << ' ';
    st.pop();

    // modify top element
    st.top() = 77;

    // push two new elements
    st.push(4);
    st.push(5);

    // pop one element without processing it
    st.pop();

    // pop and print remaining elements
    while (!st.empty()) {
        cout << st.top() << ' ';
        st.pop();
    }
    cout << endl;
}
3 2 4 77








21.1.stack
21.1.1.Instantiation of an STL Stack
21.1.2.Push and pop an int stack
21.1.3.Push and pop a vector stack
21.1.4.Push and pop a stack of list
21.1.5.Working with a stack of Integers
21.1.6.Stack: size, pop and push
21.1.7.Stack: size and push
21.1.8.Stack: top, empty
21.1.9.Modify the top element in a stack
21.1.10.stack of string and vector of string
21.1.11.A stack for characters
21.1.12.stack of pairs
21.1.13.Pass stack to a function