现在骂人都不会被关小黑屋了喔# Living
a*e
1 楼
http://articles.leetcode.com/2011/09/regular-expression-matchin
在什么输入下时间复杂度是O(2^n)? 怎么老觉得是O(N^2)呢?
class Solution {
public:
bool helper(const char *s, const char *p)
{
return ((*s==*p)||(*p=='.'&&*s!='
在什么输入下时间复杂度是O(2^n)? 怎么老觉得是O(N^2)呢?
class Solution {
public:
bool helper(const char *s, const char *p)
{
return ((*s==*p)||(*p=='.'&&*s!='