leetcode 44

python

Author: kyle8998

README.md

@@ -45,6 +45,7 @@ Personal Practice Set - Doing One a Day (sometimes) in a Variety of Languages (M
 | 39 | Medium     | [Combination Sum](leetcode/39-Medium-Combination-Sum/problem.md)                             | [Python](leetcode/39-Medium-Combination-Sum/answer.py)            |
 | 40 | Medium     | [Combination Sum II](leetcode/40-Medium-Combination-Sum-II/problem.md)                       | [Python](leetcode/40-Medium-Combination-Sum-II/answer.py)         |
 | 42 | Hard       | [Trapping Rain Water](leetcode/42-Hard-Trapping-Rain-Water/problem.md)                       | [Python](leetcode/42-Hard-Trapping-Rain-Water/answer.py)          |
+| 44 | Hard       | [Wildcard Matching](leetcode/44-Hard-Wildcard-Matching/problem.md)                           | [Python](leetcode/44-Hard-Wildcard-Matching/answer.py)            |
 | 46 | Medium     | [Permutations](leetcode/46-Medium-Permutations/problem.md)                                   | [Python](leetcode/46-Medium-Permutations/answer.py)               |
 | 47 | Medium     | [Permutations II](leetcode/47-Medium-Permutations-II/problem.md)                             | [Python](leetcode/47-Medium-Permutations-II/answer.py)            |
 | 48 | Medium     | [Rotate Image](leetcode/48-Medium-Rotate-Image/problem.md)                                   | [Python](leetcode/48-Medium-Rotate-Image/answer.py)               |

leetcode/44-Hard-Wildcard-Matching/answer.py

@@ -0,0 +1,75 @@
+#!/usr/bin/python3
+
+#------------------------------------------------------------------------------
+# First Solution
+# Not too efficient with all the recursion lol
+#------------------------------------------------------------------------------
+
+class Solution(object):
+    def isMatch(self, s, p):
+        """
+        :type s: str
+        :type p: str
+        :rtype: bool
+        """
+        i = 0
+        for j in range(len(p)):
+            # If str is longer than pattern -> false
+            if i > len(s)-1:
+                 # it could potentially be true if the remaining characters are *s
+                if p[j:].replace("*","") == "":
+                    return True
+                return False
+            if p[j] == '?':
+                # If ?, then increment index
+                i += 1
+            elif p[j] == '*':
+                # If last char in pattern, then true
+                if j == len(p)-1:
+                    return True
+                # We want to check all possibilities
+                for curr in range(i, len(s)):
+                    # If the current char is equal to the next char in the pattern or ?
+                    if s[curr] == p[j+1] or p[j+1] == '?' or p[j+1] == '*':
+                        if self.isMatch(s[curr:], p[j+1:]):
+                            return True
+                return False
+            else:
+                # If any char, check char and increment
+                if p[j] != s[i]:
+                    return False
+                i += 1
+        return i == len(s)
+                    
+                    
+        
+#------------------------------------------------------------------------------
+# DP Solution
+#------------------------------------------------------------------------------
+class Solution(object):
+    def isMatch(self, s, p):
+        """
+        :type s: str
+        :type p: str
+        :rtype: bool
+        """
+        ls = len(s)
+        lp = len(p)
+        dp = [[False]*(len(p)+1) for i in range(len(s)+1)]
+        
+        dp[0][0] = True
+        
+        for i in range(1,len(p)+1):
+            if p[i-1] == '*' and dp[0][i-1]:
+                dp[0][i] = True
+        
+        for row in range(1, len(s)+1):
+            for col in range(1, len(p)+1):
+                if s[row-1] == p[col-1] or p[col-1]=='?':
+                    dp[row][col] = True and dp[row-1][col-1]
+                elif p[col-1] == '*':
+                    dp[row][col] = dp[row][col-1] or dp[row-1][col-1] or dp[row-1][col]
+        return dp[len(s)][len(p)]
+
+#------------------------------------------------------------------------------
+#Testing

leetcode/44-Hard-Wildcard-Matching/problem.md

@@ -0,0 +1,52 @@
+# Problem 44: Wildcard Matching
+
+#### Difficulty: Hard
+
+#### Problem
+
+Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*'.
+
+'?' Matches any single character.
+
+'*' Matches any sequence of characters (including the empty sequence).
+
+The matching should cover the entire input string (not partial).
+
+#### Example
+
+<pre>
+Example 1:
+
+Input:
+s = "aa"
+p = "a"
+Output: false
+Explanation: "a" does not match the entire string "aa".
+Example 2:
+
+Input:
+s = "aa"
+p = "*"
+Output: true
+Explanation: '*' matches any sequence.
+Example 3:
+
+Input:
+s = "cb"
+p = "?a"
+Output: false
+Explanation: '?' matches 'c', but the second letter is 'a', which does not match 'b'.
+Example 4:
+
+Input:
+s = "adceb"
+p = "*a*b"
+Output: true
+Explanation: The first '*' matches the empty sequence, while the second '*' matches the substring "dce".
+Example 5:
+
+Input:
+s = "acdcb"
+p = "a*c?b"
+Output: false
+</pre>