数据结构-队列和堆栈-javascript应用

// 堆栈和队列判断回文字符串
// js 队列的数组实现：arr.push()=>入队，arr.shift()=>出队
// js 堆栈的数组实现： arr.unshift() =>入栈,arr.shift() => 出栈
let hStr = 'abcdedcba';
function isHW(hStr) {
    let queue = hStr.split("");
    let stack = hStr.split("");
    console.log(queue);
    console.log(stack);
    let len = queue.length;
    let i;
    for (i = 0; i < len; i++) {
        if (queue.pop() != stack.shift()) {
            return false;
        }
    }
    return true;
}

let result = isHW(hStr);
console.log(result);

// 利用栈判断左右括号是否匹配
function validSymbol(str) {
    debugger;
    let leftS = ['(', '{', '['];
    let rightS = [')', '}', ']'];

    let leftStack = [];
    let lIndex = -1;
    let rIndex = -1;
    for (let s in str) {
        lIndex = leftS.indexOf(str[s]);
        rIndex = rightS.indexOf(str[s]);
        if (lIndex != -1) {
            leftStack.unshift(lIndex);
        } else if (rIndex != -1) {
            if (rIndex != leftStack.shift()) {
                return false;
            }
        }
    }
    return true;
}
let result = validSymbol("{[())]}");
console.log(result)