Runtime: 5 ms (Top 57.68%) | Memory: 42.9 MB (Top 39.28%)

Author: AnasImloul

scripts/algorithms/R/Regular Expression Matching/Regular Expression Matching.java

@@ -1,21 +1,22 @@
+// Runtime: 5 ms (Top 57.68%) | Memory: 42.9 MB (Top 39.28%)
 class Solution {
     public boolean isMatch(String s, String p) {
         if (p == null || p.length() == 0) return (s == null || s.length() == 0);
-        
+
         boolean dp[][] = new boolean[s.length()+1][p.length()+1];
         dp[0][0] = true;
         for (int j=2; j<=p.length(); j++) {
-            dp[0][j] = p.charAt(j-1) == '*' && dp[0][j-2]; 
+            dp[0][j] = p.charAt(j-1) == '*' && dp[0][j-2];
         }
-        
+
         for (int j=1; j<=p.length(); j++) {
             for (int i=1; i<=s.length(); i++) {
-                if (p.charAt(j-1) == s.charAt(i-1) || p.charAt(j-1) == '.') 
-					dp[i][j] = dp[i-1][j-1];
+                if (p.charAt(j-1) == s.charAt(i-1) || p.charAt(j-1) == '.')
+                    dp[i][j] = dp[i-1][j-1];
                 else if(p.charAt(j-1) == '*')
-                    dp[i][j] = dp[i][j-2] || ((s.charAt(i-1) == p.charAt(j-2) || p.charAt(j-2) == '.') && dp[i-1][j]); 
+                    dp[i][j] = dp[i][j-2] || ((s.charAt(i-1) == p.charAt(j-2) || p.charAt(j-2) == '.') && dp[i-1][j]);
             }
         }
         return dp[s.length()][p.length()];
     }
-}
+}