密码搜索[BFS]

// // 将 s[j] 向上拨动⼀次 
function plusOne(s, j) {

    s = s.split('')

    if (s[j] == '9') { s[j] = '0'; } else { s[j] = s[j] - 0 + 1; }
    return s.toString().replace(/,/g, '')

}
// 将 s[i] 向下拨动⼀次 
function minusOne(s, j) {
    s = s.split('')
    if (s[j] == '0') { s[j] = '9'; } else { s[j] -= 1; }  

    return s.toString().replace(/,/g, '');
}

let deadends = ["0201","0101","0102","1212","2002"], target = "0202"

// BFS 框架，打印出所有可能的密码  
function BFS(start,target) {

    let deadSet=new Set(deadends)
    let q = [];
    let visited = new Set()
    visited.add(start)
    q.push(start)
    let res=0,tl=start.length
    while (sz=q.length) {

        /* 将当前队列中的所有节点向周围扩散 */
        for (let i = 0; i < sz; i++) {
            let cur = q.shift();
            if(deadSet.has(cur)) continue
            if (cur == target) {return res}
            for (let j = 0; j < tl; j++) {
                up = plusOne(cur, j);
                down = minusOne(cur, j);
                if (up == target || down == target) {  return res + 1 }
                if (!visited.has(up)) {
                    visited.add(up)
                    q.push(up);
                }
                if (!visited.has(down)) {
                    visited.add(down)
                    q.push(down);
                }
            }

        }
        res++

    }

    return -1;
}

console.log(BFS('0000',target));

//双向bfs也可以