回溯速度慢，容易受到攻击字符串的攻击

你有没有考虑过一种更简单的方法，让你摆脱正则表达式的漏洞？你正在尝试做的是从根本上简单，所以适合基本操作，没有复杂的正则表达式？

const strings = `
PREFIX hello SUFFIX
PREFIX PREFIX SUFFIX
PREFIX SUFFIX SUFFIX
PREFIX var+2 SUFFIX

Note: PREFIX and SUFFIX are kind of fixed. in between these words, we can have any number. of words.`.split("\n")

const prefix = "PREFIX"
const suffix = "SUFFIX"

strings.forEach(s => {
  const first = s.indexOf(prefix);
  const last = s.lastIndexOf(suffix);
  if (first > -1 && last > -1 && last > first) {
    out = s.slice(first, last + suffix.length);
    console.log(out)
  }
})