【算法第四版 读书笔记】定容栈，下压栈

定容栈

class FixedCapacityStack {
	int* a = nullptr;		//stack entries
	int N;					//size


public:
	FixedCapacityStack(int cap) {	
		a = new int(cap);	
	}

	bool isEmpty() {	
		return N == 0;	
	}

	int size() {	
		return N;	
	}

	void push(int val) {	
		a[N++] = val;	
	}

	int pop() {	
		return a[--N];	
	}
};

下压栈（动态扩容数组）

//vector实现
class ResizingArrayStack {
	vector<int>a;
	int N = 0;
	void resize(int max) {
		vector<int>temp(a);
		a = vector<int>(max);
		for (int i = 0; i < N; ++i)
			a[i] = temp[i];
	}

public:
	ResizingArrayStack() {
		a = vector<int>(1);
	}
	bool isEmpty() {
		return N == 0;
	}
	int size() {
		return N;
	}
	void push(int val) {
		if (N == a.size())
			resize(2 * a.size());
		a[N++] = val;
	}
	int pop() {
		int val = a[--N];
		if (N > 0 && N == a.size()/ 4)
			resize(a.size() / 2);
		return val;
	}
};

//指针实现
#define sz sizeof(a)/sizeof(int)

class ResizingArrayStack {
	int* a = new int(1);
	int N = 0;				
	void resize(int max) {
		int* temp = new int(max);
		for (int i = 0; i < N; ++i)
			temp[i] = a[i];
		a = temp;
	}

public:
	bool isEmpty() {
		return N == 0;
	}
	int size() {
		return N;
	}
	void push(int val) {
		if (N == sz)
			resize(2 * sz);
		a[N++] = val;
	}
	int pop() {
		int val = a[--N];
		if (N > 0 && N == sz / 4)	
			resize(sz/ 2);
		return val;
	}
};