The question Complexity of Regex substitution nears the question, but it is not the same. According to the reply by theprise, the complexity (of a DFA engine) is: n
阅读背景：
多项式时间中最长的正则表达式是什么？
来源：互联网
分享到：
