Breaking News: Grepper is joining You.com. Read the official announcement!

c++ stack

Add Answer

Dead Dugong answered on November 2, 2020 Popularity 10/10 Helpfulness 2/10

answer c++ stack

related stack c++

related stack algorithm in c++

related Basic stack implementation in c++

related stack in c++

c++ stack

Comment

#include <iostream>
#include <stack>
using namespace std;
int main() {
    stack<int> stack;
    stack.push(21);
    stack.push(22);
    stack.push(24);
    stack.push(25);
       
         stack.pop();
    stack.pop();
   
    while (!stack.empty()) {
        cout << stack.top() <<" ";
        stack.pop();
    }
}

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ stack using

Link to this answer
Share Copy Link

Contributed on Sep 26 2022

Dead Dugong

0 Answers Avg Quality 2/10

Closely Related Answers

stack c++

Comments(1)

#include <bits/stdc++.h> 

stack<int> stk;
stk.push(5);
int ans = stk.top(5); // ans =5
stk.pop();//removes 5

Popularity 10/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Nov 02 2020

Sparkling Seahorse

0 Answers Avg Quality 2/10

stack c++

Comment

/* Stack is a data structure that provides two O(1) time operations:
adding an element to the top and removing an element from the top.
It is only possible to access the top element of a stack. */
stack<int> s;
s.push(3);
s.push(2);
s.push(5);
cout << s.top(); // 5
s.pop();
cout << s.top(); // 2

Popularity 10/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Apr 13 2021

BreadCode

0 Answers Avg Quality 2/10

stack algorithm in c++

Comment

#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
class stack

Popularity 1/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: algorithm c++ stack

Link to this answer
Share Copy Link

Contributed on Apr 26 2021

Excited Emu

0 Answers Avg Quality 2/10

Basic stack implementation in c++

Comment

-1

/* C++ program to implement basic stack
   operations */
#include <bits/stdc++.h>

using namespace std;

#define MAX 1000

class Stack {
    int top;

public:
    int a[MAX]; // Maximum size of Stack

    Stack() { top = -1; }
    bool push(int x);
    int pop();
    int peek();
    bool isEmpty();
};

bool Stack::push(int x)
{
    if (top >= (MAX - 1)) {
        cout << "Stack Overflow";
        return false;
    }
    else {
        a[++top] = x;
        cout << x << " pushed into stack\n";
        return true;
    }
}

int Stack::pop()
{
    if (top < 0) {
        cout << "Stack Underflow";
        return 0;
    }
    else {
        int x = a[top--];
        return x;
    }
}
int Stack::peek()
{
    if (top < 0) {
        cout << "Stack is Empty";
        return 0;
    }
    else {
        int x = a[top];
        return x;
    }
}

bool Stack::isEmpty()
{
    return (top < 0);
}

// Driver program to test above functions
int main()
{
    class Stack s;
    s.push(10);
    s.push(20);
    s.push(30);
    cout << s.pop() << " Popped from stack\n";
    //print all elements in stack :
    cout<<"Elements present in stack : ";
    while(!s.isEmpty())
    {
        // print top element in stack
        cout<<s.peek()<<" ";
        // remove top element in stack
        s.pop();
    }

    return 0;
}

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: www.geeksforgeeks.org

Tags: basic basi

Link to this answer
Share Copy Link

Contributed on Jan 11 2022

Condemned Crocodile

0 Answers Avg Quality 2/10

stack in c++

Comments(1)

-1

#include <iostream>

using namespace std;
#define M 100 //defined the size of the stack ;

//stack class for controlling

class STACK
{
    int ara[M]; // declared an array for storing the stack elemenst
    int top; // finding the top value
public:
    //function for pushing values into the stack
    STACK() // constructor for initializing
    {
        top = 0;
    }
    void push(int n)
    {
        if(top == M) // checking if the stack is full or not
        {
            cout << "Stack is full\n";
            return;
        }else // if the stack is not full, push the element
        {
            ara[top] = n;
            top++;
        }
    }
    //function for poping out elements from the stack or getting the elements
    int pop()
    {
        if(top == 0)
        {
            cout << "Stack is empty\n";
            return 0;
        }else
        {
            top--;
            return ara[top];
        }
    }
    
};


int main()
{
    STACK stk1, stk2; //making two objects of type STACK
    
    //pushing elements
    for(int i = 0; i < 5; i++)
    {
        stk1.push(i);
        stk2.push(i+1);
    }
    
    //poping elements
    for(int i = 0; i < 5; i++)
    {
        cout << stk1.pop() << " ";
    }
    
    cout << "\n";
    
    for(int i = 0; i < 5; i++)
    {
        cout << stk2.pop() << " ";
    }
    cout << "\n";
    return 0;
}

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jan 24 2022

rifatibn

0 Answers Avg Quality 2/10

stack in c++

Comment

-2

#take input 2D vector

vector<vector<int> > v;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
v[i].push_back(data);
}}

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jul 09 2021

Magnificent Mink

0 Answers Avg Quality 2/10

c++ stack

Contents

More Related Answers

c++ stack

Closely Related Answers

stack c++

stack c++

stack algorithm in c++

Basic stack implementation in c++

stack in c++

stack in c++

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.