1178. Number of Valid Words for Each Puzzle Javascript

/**
 * @param {string[]} words
 * @param {string[]} puzzles
 * @return {number[]}
 */
var findNumOfValidWords = function(words, puzzles) {
    let start = (new Date()).getTime();
    console.log('start');
    let len = puzzles.length;
    let possis = [];
    for(let j = 0; j < len; ++j) {
        let pos = [];
        let first = puzzles[j][0];
        puzzles[j] = puzzles[j].split('').sort();
        let index = puzzles[j].indexOf(first);

        for(let i = 0; i < 128; ++i) {
            let str = i.toString(2).split('');
            if(str[index] !== '1') {
                continue;
            }
            let tmp = '';
            for(let k = 0; k < str.length; ++k) {
                if (str[k] === '1') {
                    tmp += puzzles[j][k];
                }
            }
            pos.push(tmp);
        }
        possis.push(pos); // 预先把可能的答案存储好哦
    }
    let lenW = words.length;
    for(let i = 0; i < lenW; ++i) {
        words[i] = [...new Set(words[i].split(''))].sort().join('');
    }
    console.log('time', (new Date()).getTime() - start)
    let res = [];
    for(let j = 0; j < len; ++j) {
        let count = 0;
        for(let i = 0; i < lenW; ++i) {
            if (possis[j].includes(words[i])) {
                count ++;
            }
        }
        res.push(count);
    }
    console.log('time', (new Date()).getTime() - start)
    return res;
};

/**
 * @param {string[]} words
 * @param {string[]} puzzles
 * @return {number[]}
 */
var findNumOfValidWords = function(words, puzzles) {
    let ans = [];
    let bit2cnt = new Map();
    for (let i = 0; i < words.length; ++i) {
        let k = 0;
        for(let j = 0; j < words[i].length; ++j) {
            k |= (1 << (words[i][j].charCodeAt(0) - 96));
        }
        let tmp = bit2cnt.get(k) || 0;
        bit2cnt.set(k, tmp + 1)
    }
    
    for(let i = 0; i < puzzles.length; ++i) {
        ans.push(0);
        let k = 0;
        for(let j = 0; j < puzzles[i].length; ++j) {
            k |= (1 << (puzzles[i][j].charCodeAt(0) - 96));
        }
        for(let j = k; j; j = (j - 1) & k) {
            if ((1 << (puzzles[i][0].charCodeAt(0) - 96)) & j)
                ans[i] += (bit2cnt.get(j) || 0);
        }
    }
    return ans;
};