手写环形缓存区域，实现push，pop，front，back等函数

622. 设计循环队列

class MyCircularQueue {
public:
	/** Initialize your data structure here. Set the size of the queue to be k. */
	MyCircularQueue(int k) {
		capcity = k;
		cnt = 0;
		front = 0;
		back = 0;
		data.resize(k);
	}

	/** Insert an element into the circular queue. Return true if the operation is successful. */
	bool enQueue(int value) {
		if (cnt == capcity)  return false;
		data[back] = value;
		back = (back + 1) % capcity;
		cnt++;
		return true;
	}

	/** Delete an element from the circular queue. Return true if the operation is successful. */
	bool deQueue() {
		if (cnt == 0)    return false;
		front = (front + 1) % capcity;
		cnt--;
		return true;
	}

	/** Get the front item from the queue. */
	int Front() {
		if (isEmpty())   return -1;
		return data[front];
	}

	/** Get the last item from the queue. */
	int Rear() {
		if (isEmpty())   return -1;
		int i = (back + capcity - 1) % capcity;
		return data[i];
	}

	/** Checks whether the circular queue is empty or not. */
	bool isEmpty() {
		if (cnt == 0)
			return true;
		else
			return false;
	}

	/** Checks whether the circular queue is full or not. */
	bool isFull() {
		if (cnt == capcity)
			return true;
		else
			return false;
	}
	vector<int> data;
	int front;
	int back;
	int cnt;
	int capcity;
};