Regular Expression Matching
Given an input string
s and a pattern p, implement a function to determine if s matches p exactly. The pattern supports the following special characters: . matches any single character. * matches zero or more of the preceding element. The matching should cover the entire input string (not partial). Example 1: Input: s = "aa", p = "a" Output: true Example 2: Input: s = "ab", p = "." Output: true Constraints: 1 <= s.length <= 20 1 <= p.length <= 30 s contains only lowercase English letters. p contains lowercase English letters, '.', and ''. It is guaranteed for each appearance of the character '', there will be a previous valid character to match.JavaDP
00