有序的符号 数据结构：

typedef char STDataType;
typedef struct Stack
{
	STDataType* a;
	int top;
	int capacity;
}ST;

void StackInit(ST* ps);
void StackDestroy(ST* ps);
void StackPush(ST* ps, STDataType x);
void StackPop(ST* ps);
STDataType StackTop(ST* ps);
int StackSize(ST* ps);
bool StackEmpty(ST* ps);
void StackInit(ST* ps)
{
	assert(ps);
	ps->a = NULL;
	ps->top = 0; // ps->top = -1;
	ps->capacity = 0;
}
void StackDestroy(ST* ps)
{
	assert(ps);
	free(ps->a);
	ps->a = NULL;
	ps->capacity = ps->top = 0;
}
void StackPush(ST* ps, STDataType x)
{
	assert(ps);

	if (ps->top == ps->capacity)
	{
		int newCapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;
		STDataType* tmp = realloc(ps->a, sizeof(STDataType) * newCapacity);
		if (tmp == NULL)
		{
			printf("realloc fail\n");
			exit(-1);
		}
		ps->a = tmp;
		ps->capacity = newCapacity;
	}

	ps->a[ps->top] = x;
	ps->top++;
}

void StackPop(ST* ps)
{
	assert(ps);
	assert(!StackEmpty(ps));
	ps->top--;
}

STDataType StackTop(ST* ps)
{
	assert(ps);
	assert(!StackEmpty(ps));
	return ps->a[ps->top - 1];
}

int StackSize(ST* ps)
{
	assert(ps);

	return ps->top;
}

bool StackEmpty(ST* ps)
{
	assert(ps);
	return ps->top == 0;
}


bool isValid(char * s){

//先写一个栈  
//然后依次比较
ST ps;
StackInit(&ps);
while(*s)
{
   if(*s=='('
   ||*s=='{'
   ||*s=='[')
   {   
   StackPush(&ps,*s);
   ++s;
   }
   else
   {  
    if(StackEmpty(&ps))
    {
        StackDestroy(&ps);
        return false;
    }
     STDataType top=StackTop(&ps);
     StackPop(&ps);
     if((*s == ')' && top  !='(')
     ||(*s == '}'  && top  !='{')
     ||(*s == ']'  && top  !='['))
     {
         StackDestroy(&ps);
         return  false;
     }
     else
     {
         ++s;
     }
    }
}

bool ret=StackEmpty(&ps);
StackDestroy(&ps);
return ret;


}