剑指offer
题目:正则表达式匹配
题目描述:请实现一个函数用来匹配包括’.‘和’‘的正则表达式。模式中的字符’.‘表示任意一个字符,而’'表示它前面的字符可以出现任意次(包含0次)。 在本题中,匹配是指字符串的所有字符匹配整个模式。例如,字符串"aaa"与模式"a.a"和"abaca"匹配,但是与"aa.a"和"ab*a"均不匹配
代码:
#include <iostream>
using namespace std;
class Solution
{
public:
bool match(char* str, char* pattern)
{
if(*str == '\0' && *pattern == '\0')
{
return true;
}
if(*str != '\0' && *pattern == '\0')
{
return false;
}
if(*(pattern+1) != '*')
{
if(*str == *pattern || (*str != '\0' && *pattern == '.'))
{
cout << "1.*str: " << *str << ", *pattern:" << *pattern << endl;
return match(str+1, pattern+1);
}
else
{
cout << "2.*str: " << *str << ", *pattern:" << *pattern << endl;
return false;
}
}
else
{
if(*str == *pattern || (*str != '\0' && *pattern == '.'))
{
cout << "3.*str: " << *str << ", *pattern:" << *pattern << endl;
return match(str, pattern+2) || match(str+1, pattern);
}
else
{
cout << "4.*str: " << *str << ", *pattern:" << *pattern << endl;
return match(str, pattern+2);
}
}
}
};
int main()
{
Solution A;
char str[] = "abc";
char pattern[] = "ac*bc";
bool bRet = A.match(str, pattern);
cout << bRet << endl;
}