10. Regular Expression Matching

最新推荐文章于 2021-06-06 23:23:54 发布

BigFatSheep

最新推荐文章于 2021-06-06 23:23:54 发布

阅读量138

点赞数

分类专栏： Leetcode Hard

本文链接：https://blog.csdn.net/BigFatSheep/article/details/83561704

版权

Leetcode 同时被 2 个专栏收录

385 篇文章 0 订阅

订阅专栏

Hard

51 篇文章 0 订阅

订阅专栏

Description

Given an input string (s) and a pattern §, 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).

Note:

s could be empty and contains only lowercase letters a-z.
p could be empty and contains only lowercase letters a-z, and characters like . or *.
Example 1:

Input:
s = “aa”
p = “a”
Output: false
Explanation: “a” does not match the entire string “aa”.
Example 2:

Input:
s = “aa”
p = “a*”
Output: true
Explanation: ‘*’ means zero or more of the precedeng element, ‘a’. Therefore, by repeating ‘a’ once, it becomes “aa”.
Example 3:

Input:
s = “ab”
p = “."
Output: true
Explanation: ".” means “zero or more (*) of any character (.)”.
Example 4:

Input:
s = “aab”
p = “cab”
Output: true
Explanation: c can be repeated 0 times, a can be repeated 1 time. Therefore it matches “aab”.
Example 5:

Input:
s = “mississippi”
p = “misisp*.”
Output: false

Problem URL

Solution

实现正则表达式匹配，动态规划解决。

First, we should intialize the dp array with multiple ‘*’, and s = “”. Because * may have empty a character, so set it value dp[0][I + 1] = dp[0][I -1]

Then in the iteration, if I == j or j == ‘.’, simply use the dp result ahead of them.

If j ==’*’, we have loook at whether we should empty it. If j - 1 != I and j - 1 != ‘.’, we should empty it dp[I][j + 1] = dp[I][j -1]. Or it is equal or ‘.’, we should decide mulitple how many times.

1, If p.charAt(j) == s.charAt(i) :  dp[i][j] = dp[i-1][j-1];
2, If p.charAt(j) == '.' : dp[i][j] = dp[i-1][j-1];
3, If p.charAt(j) == '*': 
   here are two sub conditions:
               1   if p.charAt(j-1) != s.charAt(i) : dp[i][j] = dp[i][j-2]  //in this case, a* only counts as empty
               2   if p.charAt(i-1) == s.charAt(i) or p.charAt(i-1) == '.':
                              dp[i][j] = dp[i-1][j]    //in this case, a* counts as multiple a 
                           or dp[i][j] = dp[i][j-1]   // in this case, a* counts as single a
                           or dp[i][j] = dp[i][j-2]   // in this case, a* counts as empty

Code

class Solution {
    public boolean isMatch(String s, String p) {
        if (s == null || p == null){
            return false;
        }
        boolean[][] dp = new boolean[s.length() + 1][p.length() + 1];
        dp[0][0] = true;
        for (int i = 0; i < p.length(); i++){
            if (p.charAt(i) == '*' && dp[0][i - 1]){
                dp[0][i + 1] = dp[0][i - 1];
            }
        }
        for (int i = 0; i < s.length(); i++){
            for(int j = 0; j < p.length(); j++){
                if (s.charAt(i) == p.charAt(j) || p.charAt(j) == '.'){
                    dp[i + 1][j + 1] = dp[i][j];
                }
                if (p.charAt(j) == '*'){
                    if (p.charAt(j - 1) != s.charAt(i) && p.charAt(j - 1) != '.'){
                        dp[i + 1][j + 1] = dp[i + 1][j - 1];
                    }
                    else{
                        dp[i + 1][j + 1] = (dp[i][j + 1] || dp[i + 1][j] || dp[i + 1][j - 1]);
                    }
                }
            }
        }
        return dp[s.length()][p.length()];
    }
}