Published: 28 Jun 2017 › Updated: 28 Jun 2017
为什么使用正则表达式会慢？
NFA构造O(n)，匹配O(nm)
DFA构造O(2n)，最小化O(kn'logn')（N'=O(2n)），匹配O(m)
n=regex长度，m=串长，k=字母表大小，n'=原始的dfa大小
Leave 为什么使用正则表达式会慢？ to:
Best Posts From binxxx
We have not curated any of binxxx's posts yet. But you can encourage our curation team to review posts by visiting them regularly and by referring other readers. Because we give priority to frequently read content.