bool isValid(char* s) {
int i = 0;
int len = strlen(s);
if(len%2) return false;
int limit = len/2;
char *stack = (char*)malloc(sizeof(char)*(len+1));
int top = 0;
for(i=0;i<len;i++)
{
char now = s[i];
if(now == '('||now=='['||now=='{')
stack[top++] = now;
else
{
if(top == 0)
return false;
if((now==')'&&stack[top-1]=='(')||(now==']'&&stack[top-
春节7天练 | Day 2:栈、队列和递归
最新推荐文章于 2021-03-28 20:52:11 发布