algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-06 09:06:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java
View File

@ -52,7 +52,12 @@ public class RegexMatching {
// Method 2: Using Recursion and breaking string using virtual index
// Time Complexity=0(2^(N+M)) Space Complexity=Recursion Extra Space
static boolean regexRecursion(String src, String pat, int svidx, int pvidx) {
static boolean regexRecursion(
String src,
String pat,
int svidx,
int pvidx
) {
if (src.length() == svidx && pat.length() == pvidx) {
return true;
}
@ -85,7 +90,13 @@ public class RegexMatching {
// Method 3: Top-Down DP(Memoization)
// Time Complexity=0(N*M) Space Complexity=0(N*M)+Recursion Extra Space
static boolean regexRecursion(String src, String pat, int svidx, int pvidx, int[][] strg) {
static boolean regexRecursion(
String src,
String pat,
int svidx,
int pvidx,
int[][] strg
) {
if (src.length() == svidx && pat.length() == pvidx) {
return true;
}
@ -123,7 +134,6 @@ public class RegexMatching {
// Method 4: Bottom-Up DP(Tabulation)
// Time Complexity=0(N*M) Space Complexity=0(N*M)
static boolean regexBU(String src, String pat) {
boolean strg[][] = new boolean[src.length() + 1][pat.length() + 1];
strg[src.length()][pat.length()] = true;
for (int row = src.length(); row >= 0; row--) {
@ -156,16 +166,16 @@ public class RegexMatching {
}
public static void main(String[] args) {
String src = "aa";
String pat = "*";
System.out.println("Method 1: " + regexRecursion(src, pat));
System.out.println("Method 2: " + regexRecursion(src, pat, 0, 0));
System.out.println("Method 3: " + regexRecursion(src, pat, 0, 0, new int[src.length()][pat.length()]));
System.out.println(
"Method 3: " +
regexRecursion(src, pat, 0, 0, new int[src.length()][pat.length()])
);
System.out.println("Method 4: " + regexBU(src, pat));
}
}
// Memoization vs Tabulation : https://www.geeksforgeeks.org/tabulation-vs-memoization/
// Question Link : https://practice.geeksforgeeks.org/problems/wildcard-pattern-matching/1