[Golang] Wildcard Pattern Matching
Question
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)
(Question copyed from [2])
Answer
For detailed explanation, please read the original post. Here only the Go implementation code is provided.
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 | package wpm func StringToRuneSlice(s string) []rune { var r []rune for _, runeValue := range s { r = append(r, runeValue) } return r } func initLookupTable(row, column int) [][]bool { lookup := make([][]bool, row) for i := range lookup { lookup[i] = make([]bool, column) } return lookup } // Function that matches input str with given wildcard pattern func WildcardPatternMatch(str, pattern string) bool { s := StringToRuneSlice(str) p := StringToRuneSlice(pattern) // empty pattern can only match with empty string if len(p) == 0 { return len(s) == 0 } // lookup table for storing results of subproblems // zero value of lookup is false lookup := initLookupTable(len(s)+1, len(p)+1) // empty pattern can match with empty string lookup[0][0] = true // Only '*' can match with empty string for j := 1; j < len(p)+1; j++ { if p[j-1] == '*' { lookup[0][j] = lookup[0][j-1] } } // fill the table in bottom-up fashion for i := 1; i < len(s)+1; i++ { for j := 1; j < len(p)+1; j++ { if p[j-1] == '*' { // Two cases if we see a '*' // a) We ignore ‘*’ character and move // to next character in the pattern, // i.e., ‘*’ indicates an empty sequence. // b) '*' character matches with ith // character in input lookup[i][j] = lookup[i][j-1] || lookup[i-1][j] } else if p[j-1] == '?' || s[i-1] == p[j-1] { // Current characters are considered as // matching in two cases // (a) current character of pattern is '?' // (b) characters actually match lookup[i][j] = lookup[i-1][j-1] } else { // If characters don't match lookup[i][j] = false } } } return lookup[len(s)][len(p)] } |
Testing:
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 | package wpm import ( "testing" ) func TestWildcardPatternMatch(t *testing.T) { if WildcardPatternMatch("", "") != true { t.Error("err") } if WildcardPatternMatch("a", "") != false { t.Error("err") } if WildcardPatternMatch("baaabab", "*****ba*****ab") != true { t.Error("err") } if WildcardPatternMatch("baaabab", "baaa?ab") != true { t.Error("err") } if WildcardPatternMatch("baaabab", "ba*a?") != true { t.Error("err") } if WildcardPatternMatch("baaabab", "a*ab") != false { t.Error("err") } if WildcardPatternMatch("aa", "a") != false { t.Error("err") } if WildcardPatternMatch("aa", "aa") != true { t.Error("err") } if WildcardPatternMatch("aaa", "aa") != false { t.Error("err") } if WildcardPatternMatch("aa", "*") != true { t.Error("err") } if WildcardPatternMatch("aa", "a*") != true { t.Error("err") } if WildcardPatternMatch("ab", "?*") != true { t.Error("err") } if WildcardPatternMatch("aab", "c*a*b") != false { t.Error("err") } } |
Tested on:
- Ubuntu Linux 16.10, Go 1.8.1
- Go Playground
References:
[1] |
[2] | Wildcard Pattern Matching - GeeksforGeeks |
[3] | Wildcard Pattern Matching - Techie Delight |