栈的应用：实现平衡括号算法

parenthesesChecker.ts

import { Stack } from './Stack';

/** 平衡括号算法 */
function parenthesesChecker(symbols: string) {
  const stack = new Stack<string>();
  const opens = '([{';
  const closers = ')]}';
  let balanced = true;
  let index = 0;
  let symbol;
  let top;

  while (index < symbols.length && balanced) {
    symbol = symbols[index];
    if (opens.indexOf(symbol) >= 0) {
      stack.push(symbol);
    } else if (stack.isEmpty()) {
      balanced = false;
    } else {
      top = stack.pop();
      if (!(opens.indexOf(top) === closers.indexOf(symbol))) {
        balanced = false;
      }
    }
    index++;
  }

  return balanced && stack.isEmpty();
}

// console.log('([])', parenthesesChecker('([])'));    // ([]) true
// console.log('{([])}', parenthesesChecker('{([])}'));    // {([])} true
// console.log('(([()])))', parenthesesChecker('(([()])))'));    // (([()]))) false
// console.log('[()[]()]()()', parenthesesChecker('([()[]()])()'));    // ([()[]()])() true