hk029
《LeetBook(LeetCode详解)》

Updated 4 years ago

yedf (@yedf) started discussion #2

3 years ago · 0 comments

Open

正则这题的复杂度不是O(n)

3.6 Regular Expression Matching

复杂度不是O(n),而是O(2^n),因为碰到(.*)时,匹配当前字符或不匹配有两种情况,都要递归搜索

No comments on this discussion.


to join this conversation on GitBook. Already have an account? Sign in to comment
Notifications

You’re not receiving notifications from this thread.


1 participant