代码随想录算法营JS/TS版Day11：栈与队列 (二) | LeetCode 20. 有效的括号, 1047. 删除字符串中的所有相邻重复项, 150. 逆波兰表达式求值

20. 有效的括号

function isValid(s: string): boolean {
    const stack: string[] = []
    for (let i: number = 0; i< s.length; i++){
        switch (s[i]){
            case '(':
                stack.push(')')
                break
            case '[':
                stack.push(']')
                break
            case '{':
                stack.push('}')
                break
            default:
                if (s[i] !== stack.pop()) return false
        }

    }
    return stack.length === 0
};

function isValid(s: string): boolean{
    const bracket :Map<string, string> = new Map([
        ['(',')'],
        ['{','}'],
        ['[',']'],
    ])
    const stack: string[] = []
    for (let i: number = 0; i < s.length; i++) {
        if (bracket.has(s[i]))  {
            stack.push(bracket.get(s[i]))
        }else if (stack.pop() !== s[i]){
            return false
        }

    }
    return stack.length === 0
}

1047. 删除字符串中的所有相邻重复项

function removeDuplicates(s: string): string {
    const stack: string[] = []
    for (const c of s) {
        if (stack[stack.length - 1] === c) {
            stack.pop()
        } else {
            stack.push(c)
        }
    }
    return stack.join('')
}

栈适合做对碰消消乐的逻辑

150. 逆波兰表达式求值

function evalRPN(tokens: string[]): number {
    const stack: number[] = []
    for (const t of tokens) {
        if (isNaN(Number(t))) {  //非数字
            const n2: number = stack.pop()!
            const n1: number = stack.pop()!
            switch (t) {
                case '+':
                    stack.push(n1 + n2)
                    break
                case '-':
                    stack.push(n1 - n2)
                    break
                case '*':
                    stack.push(n1 * n2)
                    break
                case "/":
                    stack.push(Math.trunc(n1 / n2))
                    break
            }
        } else { // 数字
            stack.push(Number(t))
        }
    }
    return stack[0]
}