小编Ale*_*ika的帖子

有没有人知道如何将一组混乱的字母与一个单词匹配,例如,某些与数组相匹配的函数,例如["a","c","a","e","c"]; 到一个单词"ace"并给我1或如果不是-1像indexOf或InArray但是对于一个混乱的单词.我做了一个js小提琴,其中有一个例子,它有很好的记录

只是一个注释,我将比较字母数组到30000 - 50000字.

https://jsfiddle.net/AlexanderMitrakis/89dchpt8/1/

this.gameletters = []; //Array of Game letters. 
                //e.g. ["P", "E", "H", "E", "U", "I", "S", "Q", "N"];


this.possiblesolution = new String(); //highest solution within gameletters
                //e.g. "QUEENSHIP" (related to above letters) 

this.wordBank = new Array(); 
               //array of arrays structure is formated around alphabet with an array for each character:
               /* 
                a: Array(7295)
                b:Array(7271)
                c:Array(11381)
                d:Array(7216)
                ... 
                y:Array(607)
                z:Array(623)
               */