Leetcode Problem 10. Regular Expression Matching

10. Regular Expression Matching

Leetcode Solutions

Initialize a 2D boolean array dp with dimensions (len(s) + 1) x (len(p) + 1).
Set dp[0][0] to True to represent that an empty string matches an empty pattern.
Handle patterns that start with '*' by setting dp[0][j] to True if dp[0][j-2] is True.
Iterate over each character in s and p using indices i and j.
If p[j-1] is '.' or s[i-1] == p[j-1], set dp[i][j] to the value of dp[i-1][j-1].
If p[j-1] is '*', check two conditions: a. If the pattern before '*' matches zero occurrences, set dp[i][j] to dp[i][j-2]. b. If the pattern before '*' matches one or more occurrences, set dp[i][j] to dp[i-1][j] if s[i-1] matches p[j-2].
The answer is the value at dp[len(s)][len(p)].

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen