[Leetcode] #10 Regex Matching (DFS, Dynamic Programming)

Given an input string (s) and a pattern (p), 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). https://leetcode.com/problems/regular-expression-matching/