A stack is a pile where you only touch the top: the last value you put in is the first one you take out (LIFO, last in, first out), like a pile of plates. Build a class MyStack that stores whole numbers in a private vector<int> data and offers four operations.
The methods:
void push(int value)int pop()int peek()int size()
Rules:
pushputs the value on top of the stack. It returns nothing.popremoves the top value (the one pushed last) and returns it.peekreturns the top value but leaves it on the stack, so the size does not change.sizereturns how many values are on the stack. A new stack has size 0, and after popping everything the size is 0 again.- The stack keeps working after it becomes empty: you can push again.
- Calling
poporpeekon an empty stack is not part of this exercise and the tests never do it. (In C++,back()on an empty vector is undefined behaviour.)
You start with: The starter already contains the code that uses your stack (below).
MyStack s;
s.push(10);
s.push(20);
s.push(30);
cout << "Top: " << s.peek() << endl;
cout << "Size: " << s.size() << endl;
cout << "Pop: " << s.pop() << endl;
cout << "Size: " << s.size() << endl;
cout << "Pop: " << s.pop() << endl;
cout << "Pop: " << s.pop() << endl;
cout << "Empty size: " << s.size() << endl;
s.push(7);
cout << "Top: " << s.peek() << endl;
cout << "Size: " << s.size() << endl;
Expected output:
Top: 30 Size: 3 Pop: 30 Size: 2 Pop: 20 Pop: 10 Empty size: 0 Top: 7 Size: 1
Reading the output: after pushing 10, 20 and 30 the top is 30 and the size 3. Popping gives 30, leaving size 2. Two more pops give 20 and then 10 (last in, first out), the stack is empty (size 0), and after pushing 7 the top is 7 and the size 1.
The top of the stack is the end of the list: adding and removing at the end is fast, and the last value pushed is always the last element.
vector has push_back, back() and pop_back(). pop_back() returns nothing, so save data.back() in a variable first, then remove it, then return the variable.
class MyStack {
private:
vector<int> data;
public:
void push(int value) {
data.push_back(value);
}
int pop() {
int top = data.back();
data.pop_back();
return top;
}
int peek() {
return data.back();
}
int size() {
return data.size();
}
};
Free plan: 30 tutor messages. Premium is unlimited.
