Hacktoberfest_2022/wildcard_matching.cpp at main · Pheonix-001/Hacktoberfest_2022 · GitHub

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