From 24398a6eb2e4a8629b1171a09031fb305a5b9f62 Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Wed, 11 Jan 2023 20:59:03 -0500 Subject: [PATCH] Create README - LeetHub --- 10-regular-expression-matching/README.md | 42 ++++++++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 10-regular-expression-matching/README.md diff --git a/10-regular-expression-matching/README.md b/10-regular-expression-matching/README.md new file mode 100644 index 0000000..f71004d --- /dev/null +++ b/10-regular-expression-matching/README.md @@ -0,0 +1,42 @@ +
Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*' where:
'.' 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: 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 preceding 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 (.)". ++ +
+
Constraints:
+ +1 <= s.length <= 201 <= p.length <= 30s contains only lowercase English letters.p contains only lowercase English letters, '.', and '*'.'*', there will be a previous valid character to match.