leetcode：20. Valid Parentheses

最新推荐文章于 2022-09-01 00:56:47 发布

骨头骨头骨头

最新推荐文章于 2022-09-01 00:56:47 发布

阅读量171

点赞数

分类专栏： leetcode解题报告

本文链接：https://blog.csdn.net/u012042456/article/details/51593634

版权

leetcode解题报告专栏收录该内容

13 篇文章 0 订阅

订阅专栏

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.

Subscribe to see which companies asked this question

/**
 * @param {string} s
 * @return {boolean}
 */
var isValid = function(s) {
    var stack = [];
    stackPointer = 0;
    for(var i = 0; i < s.length; i++) {
        switch(s[i]) {
            case '{':
                stack[stackPointer] = s[i];
                stackPointer++;
                break;
            case '}':
                if(stack[stackPointer-1] === '{') {
                    stackPointer--;
                } else {
                    return false;
                }
                break;
            case '[':
                stack[stackPointer] = s[i];
                stackPointer++;
                break;
            case ']':
                if(stack[stackPointer-1] === '[') {
                    stackPointer--;
                } else {
                    return false;
                }
                break;
            case '(':
                stack[stackPointer] = s[i];
                stackPointer++;
                break;
            case ')':
                if(stack[stackPointer-1] === '(') {
                    stackPointer--;
                } else {
                    return false;
                }
                break;
            default:
                continue;
        }
    }
    if(stackPointer === 0) {
        return true;
    } else {
        return false;
    }
};

试着缩短了代码

/**
 * @param {string} s
 * @return {boolean}
 */
var isValid = function(s) {
    var stack = [];
    stackPointer = 0;
    for(var i = 0; i < s.length; i++) {
        switch(s[i]) {
            case '{':
            case '[':
            case '(':
                stack[stackPointer++] = s[i];
                break;
            case '}':
                if(stackPointer === 0 || stack[--stackPointer] !== '{' ) 
                    return false;
                break;
            case ']':
                if(stackPointer === 0 || stack[--stackPointer] !== '[' ) 
                    return false;
                break;
            case ')':
                if(stackPointer === 0 || stack[--stackPointer] !== '(' ) 
                    return false;
                break;
            default:
                continue;
        }
    }
    return stackPointer === 0;
};