栈与队列OJ题

1、栈与队列的实现

//队列
ListNode*BuyListNode(LTDataType x)
{
   
	ListNode *node = (ListNode*)malloc(sizeof(ListNode));
	node->data = x;
	node->next = NULL;
	node->prev = NULL;
	return node;
}

ListNode*ListCreate()
{
   
	ListNode*head = (ListNode*)malloc(sizeof(ListNode));
	head->next = head;
	head->prev = head;
	return head;
}

void ListPrint(ListNode * pHead)
{
   
	assert(pHead);
	ListNode*cur = pHead->next;
	while (cur != pHead)
	{
   
		print("%d->", cur->data);
		cur = cur->next;
	}
	printf("\n");
}

void ListDestroy(ListNode*pHead)
{
   
	ListNode * cur = pHead -> next;
	while (cur != pHead)
	{
   
		ListNode*next = cur->next;
		free(cur);
		cur = next;
	}
	free(pHead);
}

void ListPushBack(ListNode*pHead, LTDataType x)
{
   
	assert(pHead);
	ListInsert(pHead, x);
}

void ListPushFront(ListNode*pHead, LTDataType x)
{
   
	assert(pHead);
	ListInsert(pHead->next, x);
}
void ListPopBack(ListNode *pHead)
{
   
	assert(pHead);
	ListErase(pHead->prev);
}
void ListPopFront(ListNode *pHead)
{
   
	ListErase(pHead->next);
}
void ListInsert(ListNode*pos, LTDataType x)
{
   
	assert(pos);
	ListNode*prev = pos->prev;
	ListNode*newnode = BuyListNode(x);
	prev->next = newnode;
	newnode->prev = prev;
	pos->prev = newnode;
}
void ListErae(ListNode*pos)
{
   
	assert(pos);
	ListNode*prev = pos->prev;
	ListNode*next = pos->next;
	prev->next = next;
	next->prev = prev;
	free(pos);
}
//栈
void CheckCapacity(Stack*ps)
{
   
	if (ps->size >= ps->capacity)
	{
   
		ps->capacity *= 2;
		ps->array = (STDataType*)realloc(ps->arry, ps->capacity*sizeof(STDataType));
	}
}

void StackInit(Stack*ps)
{
   
	ps->array = (STDataType*)calloc(DEFTACKSIZE, sizeof(STDataType));
	ps->capacity = DEFSTACKSIZE;
	ps->size = 0;
}

void StackPushStack*ps,STDataType x)
{
   
	CheckCapacity(ps);
	ps->array[ps->size] = x;
	ps->size++;
}
void StackPop(Stack*ps)
{
   
	if (ps->size == 0)
	{
   
		return;
	}
	ps->size--;
}
STDataType StackTop