此解法用JavaScript寫的,然後運行速度在leetcode上秒殺所有人,是迄今為止JavaScript上最快的解法

哈哈哈 很開心~~~

/**
* @param {string} s
* @return {boolean}
*/
var isValid = function(s) {
let stack = [];
var len = 0;
let arr = s.split(‘‘);

for (let i = 0; i < arr.length; i++) {
let str = arr[i];
switch (str) {
case ‘(‘:
stack[len] = str;
len++;
break;
case ‘[‘:
stack[len] = str;
len++;
break;
case ‘{‘:
stack[len] = str;
len++;
break;
case ‘)‘:
if (stack[len-1] == ‘(‘)
len--;
else
return false;
break;
case ‘]‘:
if (stack[len-1] == ‘[‘)
len--;
else
return false;
break;
case ‘}‘:
if (stack[len-1] == ‘{‘)
len--;
else
return false;
break;
}
}

if (len == 0)
return true;
else
return false;
};

括號匹配問題[leetcode]