腾讯2020校园招聘-后台

链接：牛客 腾讯2020校园招聘-后台
记录一下自己的想法以及一些大佬的分享的算法

压缩算法

var line = readline();

var solution = (str) => {
    //递归,每次处理最内层
    const fn = (str) => {
        let x = -1, y = -1, z = -1, i = 0;
        //找到最内层[ | ]对应的下标
        while(i < str.length){
            if(str[i] === '[') x = i;
            else if(str[i] === '|') y = i;
            else if(str[i] === ']'){
                z = i;
                break;
            } 
            i++;
        }
        //找到了则做解压处理
        if(x != -1 && y != -1 && z != -1){
            let num = Number(str.slice(x + 1, y));
            let t = str.slice(y + 1, z);
            str = str.slice(0, x) + t.repeat(num) + str.slice(z + 1);
            return fn(str);
        }
        return str;
    }
    return fn(str);
}

console.log(solution(line));

逛街

其实我觉得这题的意思有点难懂，好在看完评论以后搞明白了：小Q站在当前楼的正中间，可以看到的楼就包括当前楼以及前后没有被挡住的楼（当前楼不管是否高于旁边的楼都不会挡住它）

var n = Number(readline());
var line = readline();
var lines = line.split(' ');
var h = new Array(n);
for(let i = 0; i < n; i++){
    h[i] = Number(lines[i]);
}

var solution = (n, h) => {
    var left = [], right = [];
    var stack1 = [], stack2 = [];
    for(let i = 0, j = n - 1; i < n, j >= 0; i++, j--){
        left.push(stack1.length);
        right.push(stack2.length);
        
        //将被挡住的剔除
        while(stack1.length != 0 && stack1[stack1.length-1] <= h[i]) stack1.pop();
        while(stack2.length != 0 && stack2[stack2.length-1] <= h[j]) stack2.pop();
        stack1.push(h[i]);
        stack2.push(h[j]);
    }
    right = right.reverse();
    for(let i = 0; i < n; i++){
        left[i] += right[i] + 1;
    }
    return left.join(' ');
}

console.log(solution(n, h));