44 - Wildcard Matching

 JAVA

• class Solution {
      public boolean isMatch(String s, String p) {
          int m = s.length(), n = p.length();
          boolean[][] dp = new boolean[m + 1][n + 1];
          dp[0][0] = true;
          for (int j = 1; j <= n; ++j) {
              if (p.charAt(j - 1) == '*') {
                  dp[0][j] = dp[0][j - 1];
              }
          }
          for (int i = 1; i <= m; ++i) {
              for (int j = 1; j <= n; ++j) {
                  if (s.charAt(i - 1) == p.charAt(j - 1) || p.charAt(j - 1) == '?') {
                      dp[i][j] = dp[i - 1][j - 1];
                  } else if (p.charAt(j - 1) == '*') {
                      dp[i][j] = dp[i - 1][j] || dp[i][j - 1];
                  }
              }
          }
          return dp[m][n];
      }
  }

C++

• class Solution {
  public:
      bool isMatch(string s, string p) {
          int m = s.size(), n = p.size();
          vector<vector<bool>> dp(m + 1, vector<bool>(n + 1));
          dp[0][0] = true;
          for (int j = 1; j <= n; ++j) {
              if (p[j - 1] == '*') {
                  dp[0][j] = dp[0][j - 1];
              }
          }
          for (int i = 1; i <= m; ++i) {
              for (int j = 1; j <= n; ++j) {
                  if (s[i - 1] == p[j - 1] || p[j - 1] == '?') {
                      dp[i][j] = dp[i - 1][j - 1];
                  } else if (p[j - 1] == '*') {
                      dp[i][j] = dp[i - 1][j] || dp[i][j - 1];
                  }
              }
          }
          return dp[m][n];
      }
  };