试解leetcode算法题--设计循环双端队列

<题目描述>
设计实现双端队列，支持以下操作：
MyCircularDeque(k)：构造函数,双端队列的大小为k。
insertFront()：将一个元素添加到双端队列头部。 如果操作成功返回 true。
insertLast()：将一个元素添加到双端队列尾部。如果操作成功返回 true。
deleteFront()：从双端队列头部删除一个元素。 如果操作成功返回 true。
deleteLast()：从双端队列尾部删除一个元素。如果操作成功返回 true。
getFront()：从双端队列头部获得一个元素。如果双端队列为空，返回 -1。
getRear()：获得双端队列的最后一个元素。 如果双端队列为空，返回 -1。
isEmpty()：检查双端队列是否为空。
isFull()：检查双端队列是否满了。
<原题链接>
https://leetcode-cn.com/problems/design-circular-deque/
<理明思路>
使用链表来实现双端循环队列
<样例代码>

#include<iostream>
using namespace std;
class MyCircularDeque {
public:
	/** Initialize your data structure here. Set the size of the deque to be k. */
	MyCircularDeque(int k)
	{
		deque_size = k;
		p = NULL;
		head = NULL;
		tail = NULL;
	}

	/** Adds an item at the front of Deque. Return true if the operation is successful. */
	bool insertFront(int value) 
	{
		if (isFull())
			return false;
		p = new Deque;
		p->x = value;
		p->next = NULL;
		if (isEmpty())
		{
			head = p;
			tail = p;
			head->next = tail;
			tail->next = head;
		}
		else
		{
			p->next = head;
			head = p;
			tail->next = p;
		}
		return true;
	}

	/** Adds an item at the rear of Deque. Return true if the operation is successful. */
	bool insertLast(int value) 
	{
		if (isFull())
			return false;
		p = new Deque;
		p->x = value;
		p->next = NULL;
		if (isEmpty())
		{
			head = p;
			tail = p;
			head->next = tail;
			tail->next = head;
		}
		else
		{
			tail->next = p;
			p->next = head;
			tail = p;
		}
		return true;
	}

	/** Deletes an item from the front of Deque. Return true if the operation is successful. */
	bool deleteFront()
	{
		if (isEmpty())
			return false;
		Deque * t;
		if (head == tail)
		{
			delete head;
			head = NULL;
			tail = NULL;
		}
		else
		{
			t = head->next;
			tail->next = t;
			delete head;
			head = t;
		}
		return true;
	}

	/** Deletes an item from the rear of Deque. Return true if the operation is successful. */
	bool deleteLast() 
	{
		if (isEmpty())
			return false;
		Deque * t;
		if (head == tail)
		{
			delete tail;
			head = NULL;
			tail = NULL;
		}
		else
		{
			for (t = head; t->next != tail; t = t->next);
			t->next = head;
			delete tail;
			tail = t;
		}
		return true;
	}

	/** Get the front item from the deque. */
	int getFront() 
	{
		if (isEmpty())
			return -1;
		return head->x;
	}

	/** Get the last item from the deque. */
	int getRear() 
	{
		if (isEmpty())
			return -1;
		return tail->x;
	}

	/** Checks whether the circular deque is empty or not. */
	bool isEmpty() 
	{
		if (head == NULL)
			return true;
		return false;
	}

	/** Checks whether the circular deque is full or not. */
	bool isFull() 
	{
		Deque * t;
		int _count = 0;
		for (t = head; t != tail; t = t->next)
			_count++;
		++_count;
		return _count == deque_size;
	}
private:
	unsigned int deque_size;
	struct Deque
	{
		int x;
		struct Deque * next;
	}*p, *head, *tail;
};