Source |
CodingSec |
Identifiant |
3832 |
Date de publication |
2016-07-10 16:30:11 (vue: 2016-07-10 16:30:11) |
Titre |
What is wild card pattern matching algorithm |
Texte |
Given a text and a wildcard pattern, implement wildcard pattern matching algorithm that finds if wildcard pattern is matched with text. The matching should cover the entire text (not partial text). The wildcard pattern can include the characters '?' and '*' '?' – matches any single character '*' – Matches any sequence of characters (including the empty sequence) For example, Text = "baaabab", Pattern = “*****ba*****ab", output : true Pattern = "baaa?ab", output : true Pattern = "ba*a?", output : true Pattern = "a*ab", output : false Each occurrence of '?' character in wildcard pattern can be replaced with any |
Envoyé |
Oui |
Condensat |
"ba*a "baaa ab" algorithm any appeared can card character characters coding cover each empty entire example false finds first given implement include including matched matches matching not occurrence output partial pattern post replaced security sequence should single text true what wild wildcard “*****ba*****ab" |
Tags |
|
Stories |
|
Notes |
|
Move |
|