栈

#pragma once
#include <iostream>
#include <assert.h>
using namespace std;
template <class T>
class Stack
{
public:
	Stack()
		:_array(NULL)
		, _capacity(0)
		, _size(0)
	{}
	~Stack()
	{
		if (_array)
		{
			delete[] _array;
		}
	}
	Stack(const Stack<T>&s);
	Stack<T>& operator=(const Stack<T>& s);
public:
	void Push(const T& x)
	{
		_CheckCapacity(_size+1);
		_array[_size++] = x;
	}
	void Pop()
	{
		assert(_size > 0);
		_size--;
	}
	size_t size()
	{
		return _size;
	}
	bool Empty()
	{
		return _size == 0;
	}
	const T&Top()
	{
		assert(_size > 0);
		return _array[_size - 1];
	}
protected:
	void _CheckCapacity(size_t size)
	{
			if (size > _capacity)
			{
				_capacity = size > 2 * _capacity ? size : 2 * _capacity;
				T* tmp = new T[_capacity];
				memcpy(tmp, _array, sizeof(T)*_size);
				delete[] _array;
				_array = tmp;
			}
	}
protected:
	T* _array;
	size_t _size;
	size_t _capacity;
};