UNPKG

@dxzmpk/js-algorithms-data-structures

Version:

Algorithms and data-structures implemented on JavaScript

github.com/dxzmpk/javascript-algorithms

dxzmpk/javascript-algorithms

74 lines (47 loc) • 1.32 kB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
# Regular Expression Matching 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). **Note** - `s` could be empty and contains only lowercase letters `a-z`. - `p` could be empty and contains only lowercase letters `a-z`, and characters like `.` or `*`. ## Examples **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 (`.`)". **Example #4** Input: ``` s = 'aab' p = 'c*a*b' ``` Output: `true` Explanation: `c` can be repeated 0 times, `a` can be repeated 1 time. Therefore it matches `aab`. ## References - [YouTube](https://www.youtube.com/watch?v=l3hda49XcDE&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8&index=71&t=0s) - [LeetCode](https://leetcode.com/problems/regular-expression-matching/description/)