Leetcode Regular Expression Matching

最新推荐文章于 2020-08-22 11:30:56 发布

每天都要有进步

最新推荐文章于 2020-08-22 11:30:56 发布

阅读量259

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/u011472124/article/details/50599969

版权

Leetcode 专栏收录该内容

262 篇文章 0 订阅

订阅专栏

Implement regular expression matching with support for '.' and '*'.

'.' Matches any single character.
'*' Matches zero or more of the preceding element.

The matching should cover the entire input string (not partial).

The function prototype should be:
bool isMatch(const char *s, const char *p)

Some examples:
isMatch("aa","a") → false
isMatch("aa","aa") → true
isMatch("aaa","aa") → false
isMatch("aa", "a*") → true
isMatch("aa", ".*") → true
isMatch("ab", ".*") → true
isMatch("aab", "c*a*b") → true

Difficulty: Hard

两个case：

1. 第二个字母是*

2. 第二个字母不是*

class Solution {
public:
    bool isMatch(string s, string p) {
        if(p.length() == 0 && s.length() == 0)
            return true;
        if(p.length() == 0 && s.length()!=0)
            return false;
        
        if(p.length() == 1){
            if(s.length() == 0)
                return false;
            else if(s[0] != p[0] && p[0] != '.')
                return false;
            else{
                if(isMatch(s.substr(1, s.length()-1), p.substr(1, p.length()-1)))
                    return true;
            }
            return false;
        }
        
        if(p[1] != '*'){
            if(s.length() == 0)
                return false;
            else if(s[0] != p[0] && p[0] != '.')
                return false;
            else{
                if(isMatch(s.substr(1, s.length()-1), p.substr(1, p.length()-1)))
                    return true;
            }
            return false;
                
        }
        
        else{
            if(isMatch(s, p.substr(2, p.length()-2)))
                return true;
            for(int i = 0; i < s.length() && (p[0] == s[i] || p[0] == '.'); i++){
                if(isMatch(s.substr(i+1, s.length()-i-1), p.substr(2, p.length()-2)))
                    return true;
            }
            return false;
            
        }
            
    }
};