Wildcard String Matching

Rokt placement identifiers may use a compact pattern format. Given a pattern s1 and a candidate string s2, determine whether the pattern matches the entire string.

The pattern supports two wildcard forms:

1. . matches exactly one arbitrary character.
2. A digit d matches exactly d arbitrary characters. Each digit is an independent token, so 23 means two wildcards followed by three wildcards, not twenty-three.
3. Any lowercase letter matches itself exactly.

Return True only when the complete pattern matches the complete candidate string. Return False otherwise.

Formal Specification

• Input: two strings s1 and s2 containing lowercase letters, digits, and . in s1, and lowercase letters in s2.
• Output: a boolean indicating whether s1 matches all of s2.
• Matching is case-sensitive, and wildcard characters may match any character, including characters that would otherwise be literals.

Examples

Example 1

Input: s1 = "r.kt", s2 = "rokt"
Output: True

The . consumes o, leaving r, k, and t to match exactly.

Example 2

Input: s1 = "a3d", s2 = "axyzd"
Output: True

The digit 3 consumes xyz.

Example 3

Input: s1 = "r2k", s2 = "rokt"
Output: False

After r2 consumes rok, the remaining character is t, not k.