Amazon is developing a string matching library. You are to develop a service that finds the longest substring that matches a given regex.
More formally, you are given two strings, a text string text, and a regex expression regex. The string regex contains exactly one wildcard character(*). A wildcard character (*) matches any sequence of zero or more lowercase English characters. A regex matches some string if it is possible to replace the wildcard character with some sequence of characters such that the regex expression becomes equal to the string. No other character can be changed. For example, regex "abc*bcd" matches "abcbcd", "abcefgbcd" and "abccbcd", whereas it does not match the strings "abcbd", "abzbcd", "abcd".
Return the length of the longest substring of text that matches the expression regex. Return -1 if there is no such substring.
Note: A substring is a contiguous sequence of characters within a string.
Function Description
Complete the function getLongestMatch in the editor below.
getLongestMatch has the following parameters:
STRING text: a stringSTRING regex: a stringReturns
int: the length of the longest substring that matches the regex, or -1 if there is no such substring.
๐ขึดเป๐ทอึ ๐ฟ Credit to Jane and txr ๐ฟ ๐ขึดเป๐ทอึ
Example 1:
Input: text = "hackerrank", regex = "ack*r"
Output: 6
Explanation:The following substrings matchregex:"acker", we can replace * with "e" and regex becomes equal to "acker". length = 5 "ackerr", we can replace * with "er" and regex becomes equal to "ackerr". length = 6 Return the length of the longest matching substring, 6.
Example 2:
Input: text = "programming", regex = "r*in"
Output: 9
Explanation:"rammin", len = 6. We can replace * with "amm" "rogrammin" len = 9. We can replace * with "ogramm"
Example 3:
Input: text = "debug", regex = "ug*eb"
Output: -1
Explanation:No substring of text begins with 'u' and ends with 'eb'
- 1 <= |text|, |regex| <= 106
- text contains lowercase English letters only
- regex contains lowercase English letters and exactly one wildcard(*) character
input:
output: