C++ 写一个栈stack

#include<iostream>
using namespace std;

class StackInt
{
public:
	StackInt()
	{
		size = 0;
		for (int& i : element)
		{
			i = 0;
		}
	}
	int getSize()
	{
		return size;
	}
	int top()
	{
		return element[size - 1];
	}
	bool empty()
	{
		return size == 0 ? true : false;
	}
	int push(int value)
	{
		element[size]=value;
		size++;
		return value;
	}
	int pop()
	{
		int temp = element[size - 1];
		element[size - 1] = 0;
		size--;
		return temp;
	}
	void getValue()
	{
		for (int i = 0; i < 5; i++)
			cout << element[i] << ' ';
		cout << endl;
	}
private:
	int element[30];
	int size;
	
};

int main()
{
	StackInt s1;
	for (int i = 1; i <= 5; i++)
	{
		s1.push(i);
	}
	cout << "s1's size: "<<s1.getSize() << endl;
	cout << "s1's top element: "<<s1.top() << endl;
	for (int i = 1; i <= 5; i++)
	{
		s1.pop();
	}
	if (s1.empty())cout << "empty";
	return 0;
}