程序员成长之旅——有效括号

题目简介

LeetCode

//支持动态增长的栈
typedef char STDataType;

typedef struct Stack
{
	STDataType* _a;//动态实现
	int _top;//有效的数据，栈顶
	int _capacity;//容量的大小
}Stack;

void StackInit(Stack* ps)
{
	assert(ps);
	ps->_a = NULL;
	ps->_capacity = ps->_top = 0;
}
void StackPush(Stack* ps, STDataType x)
{
	assert(ps);
	if (ps->_top == ps->_capacity)
	{
		int newcapacity  = ps->_capacity == 0 ? 5 : ps->_capacity * 2;
		STDataType* newstack = (STDataType*)realloc(ps->_a, newcapacity * sizeof(STDataType));
		if (NULL == newstack)
		{
			printf("realloc error!");
			exit(0);
		}
		ps->_capacity = newcapacity;
		ps->_a = newstack;
	}
	ps->_a[ps->_top] = x;
	ps->_top++;
}
void StackPop(Stack* ps)
{
	assert(ps);
	if (ps->_top == 0)
	{
		return;
	}
	ps->_top--;
}
STDataType StackTop(Stack* ps)
{
	assert(ps);
	if (ps->_top == 0)
	{
		return NULL;
	}
	return ps->_a[ps->_top-1];
}
int StackEmpty(Stack* ps)
{
	assert(ps);
	return ps->_top;
}
int StackSize(Stack* ps)
{
	assert(ps);
	return ps->_top;
}
void StackDestroy(Stack* ps)
{
	assert(ps);
	if (ps->_a != NULL)
	{
		free(ps->_a);
		ps->_a = NULL;
		ps->_capacity = ps->_top = 0;
	}
}

bool isValid(char * s){
   Stack ch;
	StackInit(&ch);
	while (*s)
	{
		switch (*s)
		{
		case'[':
		case'{':
		case'(':
			    StackPush(&ch, *s);
			    break;
	    case']':
		case'}':
		case')':
			if (StackEmpty(&ch) == 0)
			{
				return false;
			}
			else
			{
				if ((StackTop(&ch) == '(' && *s == ')') ||
					(StackTop(&ch) == '[' && *s == ']')||
					(StackTop(&ch) == '{' && *s == '}'))
				{
					StackPop(&ch);
					break;
				}
				else
				{
					StackDestroy(&ch);
					return false;
				}
			}
		}
		s++;
	}

	if (StackEmpty(&ch) == 0)
		return true;

	return false;

}