const givenArray = ['Hi, how are you'， 'how are you'， 'howdy, how you doing'] const includeValues = ["hello"， "hi"， "howdy"] const filteredStrArray = givenArray。filter(str => includeValues)str.toLowerCase().includes(value))) console.log (filteredStrArray);

你可以这样做

["hello", "hi", "howdy"].includes(str)

即使有且只有一个条件为真，它也能工作:

var str = "bonjour le monde vive le javascript";
var arr = ['bonjour','europe', 'c++'];

function contains(target, pattern){
    var value = 0;
    pattern.forEach(function(word){
      value = value + target.includes(word);
    });
    return (value === 1)
}

console.log(contains(str, arr));

与数组数据/的精确匹配

const dataArray = ["amoos"， "rifat"， "hello"]; const findId = (data, id) => { 让res = data。Find (el => el == id) 返回res ?真:假; ｝ console.log(findId(dataArray， 'Hi')) // false console.log(findId(dataArray， 'amoos')) // true

也许晚了，但这里是我的解决方案为一个数组和两个或更多的项目 / 1 | 2 /。Test (['one'， 'two'， 'three'， 'four']。加入(' '))

console.log(/ 1 | 2 /。Test (['one'， 'two'， 'three'， 'four']。加入(' ')))

您可以使用这里引用的.some方法。

some()方法测试数组中是否至少有一个元素 通过由提供的函数实现的测试。

// test cases const str1 = 'hi hello, how do you do?'; const str2 = 'regular string'; const str3 = 'hello there'; // do the test strings contain these terms? const conditions = ["hello", "hi", "howdy"]; // run the tests against every element in the array const test1 = conditions.some(el => str1.includes(el)); const test2 = conditions.some(el => str2.includes(el)); // strictly check that contains 1 and only one match const test3 = conditions.reduce((a,c) => a + str3.includes(c), 0) == 1; // display results console.log(`Loose matching, 2 matches "${str1}" => ${test1}`); console.log(`Loose matching, 0 matches "${str2}" => ${test2}`); console.log(`Exact matching, 1 matches "${str3}" => ${test3}`);

另外，正如下面一位用户提到的那样，匹配上面提到的“恰好一个”外观也很有趣(这是OP要求的)。这可以类似地用.reduce计算交点，然后检查它们是否等于1。