如题:
解:
/**
* @param {string} s
* @return {boolean}
*/
var isValid = function(s) {
//1、新建栈
//2、扫描,左括号入栈
//3、栈空合法
var stack = [];
for(var i = 0;i<s.length;i++){
var c = s[i];
if(c === '(' || c === '[' || c === '{') stack.push(c);
else {
var top = stack[stack.length - 1];
if((top === '(' && c === ')')||(top === '[' && c === ']')||(top === '{' && c === '}')){
stack.pop();
}else{
return false;
}
}
}
return stack.length == 0;
};