Determine whether a pattern p (with '.' matching any single character and '*' meaning zero or more of the preceding element) matches the entire string s. The core challenge is handling the branching choices introduced by '*' and overlapping subproblems, typically solved with recursion+memoization or dynamic programming.
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*' where: '?' Matches any single character. '*' Matches any sequence of characters (including the empty sequence). '.' Matches single character '^' Check if it starts with certain didgit The matching should cover the entire input string (not partial).
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).
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.
Amazon