编辑代码

//输入两个单词列表数组，第一个为字谜，第二个为谜底库。匹配到正确单词列表以“，”分割，如果未找到，返回“农田found”

function wordGuess(strArr,wordArr){
    let correctWordArr = []
    for(let i = 0;i<strArr.length;i++){
        let isPush = false
        for(let j = 0;j<wordArr.length;j++){
            //1.字母顺序颠倒
            let result= findAllWord(strArr[i],wordArr[j])
            if(result){
                correctWordArr.push(wordArr[j])
            }else{
                 let result= noRepeat(strArr[i],wordArr[j])
                 if(result){
                    correctWordArr.push(wordArr[j])
                 }
            }
            
        }
    }
    console.log(correctWordArr)

}
//字母顺序颠倒
function findAllWord(arr1,arr2){
    let allHas = true
    if(arr1.length === arr2.length){
        for(let item of arr1){
            if(allHas == true && (arr2.indexOf(item)<0)){
                allHas = false
            }
        }
    }else{
        allHas = false
    }
    if(allHas){
        return true
    }else{
        return false
    }
    
}
//字母去重
function noRepeat(arr1,arr2){
    let strSet = [...(new Set(arr1))].join('')
    let wordSet =  [...(new Set(arr2))].join('')
    if(strSet === wordSet){
        return true
    }else{
        return false
    }
    
    
}
wordGuess(['conection'],['connection','today'])
// wordGuess(['bdni','wooood'],['bind','wrong','wood'])