MOOC清华《面向对象程序设计》第8章：栈的实现（基于STL vector）

//main.cpp

#include <iostream>
#include "VectorStack.h"
using namespace std;

void testStack(VectorStack& stack){
	for(int i = 1; i < 5; i++)
		stack.push(i);
	
	for(int i = 0; i < 4; i++){
		cout << stack.top() << "\n";
		stack.pop();
	}
}

int main(int argc, char** argv) {
	VectorStack stack;
	testStack(stack);
	return EXIT_SUCCESS;
}

//VectorStack.h

#ifndef VectorStack_h
#define VectorStack_h

#include <vector>

class VectorStack{
private:
	std::vector<int> m_data;
public:
	bool empty(){
		return (int)m_data.size() == 0;
	}
	void push(int i){
		m_data.push_back(i);
	}
	void pop(){
		if(!empty())
			m_data.pop_back();
	}
	int top(){
		if(!empty())
			return m_data[m_data.size() - 1];
		else
			return INT_MIN;
	}
};

#endif