Warning: file_get_contents(/data/phpspider/zhask/data//catemap/9/javascript/477.json): failed to open stream: No such file or directory in /data/phpspider/zhask/libs/function.php on line 167

Warning: Invalid argument supplied for foreach() in /data/phpspider/zhask/libs/tag.function.php on line 1116

Notice: Undefined index: in /data/phpspider/zhask/libs/function.php on line 180

Warning: array_chunk() expects parameter 1 to be array, null given in /data/phpspider/zhask/libs/function.php on line 181
Javascript 如何更改此代码以检查另一个相同长度的可接受单词?_Javascript - Fatal编程技术网

Javascript 如何更改此代码以检查另一个相同长度的可接受单词?

Javascript 如何更改此代码以检查另一个相同长度的可接受单词?,javascript,Javascript,此代码: var fs = require("fs"); var words = fs.readFileSync("words.txt").toString(); words = words.split("\n"); var badLetters = /[gikmsqvwxz]/; var longestAcceptableWord = ""; for(var testWord of words) { if

此代码:

var fs = require("fs");
var words = fs.readFileSync("words.txt").toString();
words = words.split("\n");

var badLetters = /[gikmsqvwxz]/;
var longestAcceptableWord = "";

for(var testWord of words) {

  if(testWord.length <= longestAcceptableWord.length) {
    continue;
  }

  if(testWord.match(badLetters)) {  continue;  }

  longestAcceptableWord = testWord;

}

console.log(longestAcceptableWord)
var fs=require(“fs”);
var words=fs.readFileSync(“words.txt”).toString();
单词=单词。拆分(“\n”);
var badLetters=/[gikmsqvwxz]/;
var longestAcceptableWord=“”;
for(var测试单词){

如果(testWord.length,则可以将带有空字符串的数组作为
longestWords

如果单词不匹配或长度小于索引0处的最长单词,请检查,然后
继续

然后检查单词是否比存储的单词长,并为新的最长单词分配一个新数组,或者将实际单词推送到数组中

顺便说一句,您可以只获取所需的布尔值,而不是

对于不需要的空格,可以使用

让最长的单词=[''”;
for(让我们测试单词中的单词){
testWord=testWord.trim();
如果(badLetters.test(testWord)| | testWord.lengthlongestWords[0].length){
最长单词=[testWord];
}否则{
最长的单词。推(testWord);
}
}

谢谢!但仍有一件事困扰着我。当我现在运行代码:[“聚四氟乙烯”\r]时,它会在单词后面打印。如何消除这种行为?
let longestWords = [''];

for (let testWord of words) {
    testWord = testWord.trim();
    if (badLetters.test(testWord) || testWord.length < longestWords[0].length) continue;

    if (testWord.length > longestWords[0].length) {
        longestWords = [testWord];
    } else {
        longestWords.push(testWord);
    }
}