From a3ef45dc43e170bb736a1716c2a571a47b0e9412 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=D0=A5=D0=BB=D0=B5=D0=B1=D0=BD=D0=B8=D0=BA=D0=BE=D0=B2=20?=
 =?UTF-8?q?=D0=90=D0=BD=D0=B4=D1=80=D0=B5=D0=B9=20=D0=90=D0=BB=D0=B5=D0=BA?=
 =?UTF-8?q?=D1=81=D0=B0=D0=BD=D0=B4=D1=80=D0=BE=D0=B2=D0=B8=D1=87?=
 <andrey.khlebnikov@synchro.pro>
Date: Fri, 13 Dec 2024 22:16:27 +0300
Subject: [PATCH] Match

---
 .../main/java/ru/mifi/practice/vol7/Main.java | 11 +++
 .../ru/mifi/practice/vol7/wildcard/Match.java | 71 +++++++++++++++++++
 2 files changed, 82 insertions(+)
 create mode 100644 vol7/src/main/java/ru/mifi/practice/vol7/wildcard/Match.java

diff --git a/vol7/src/main/java/ru/mifi/practice/vol7/Main.java b/vol7/src/main/java/ru/mifi/practice/vol7/Main.java
index 0f5da29..e1193c8 100644
--- a/vol7/src/main/java/ru/mifi/practice/vol7/Main.java
+++ b/vol7/src/main/java/ru/mifi/practice/vol7/Main.java
@@ -8,6 +8,7 @@
 import ru.mifi.practice.vol7.fibonacci.FibonacciMemorized;
 import ru.mifi.practice.vol7.fibonacci.FibonacciRecursion;
 import ru.mifi.practice.vol7.subsequence.LongestCommonSubsequence;
+import ru.mifi.practice.vol7.wildcard.Match;
 
 import java.util.List;
 
@@ -30,6 +31,8 @@ public static void main(String[] args) {
         distance("Lev.Recur", new Levenshtein.LevenshteinRecursion(), "boobs", "bomb");
         distance("Lev.Dynam", new Levenshtein.VagnerFisherDynamicus(), "boobs", "bomb");
         lcs("Sub.Commo", new LongestCommonSubsequence.Default(), "mouse", "house");
+        match("Dyn.Regex", new Match.DefaultMatch(), "non? po?", "none pop");
+        match("Dyn.Aggrv", new Match.AbbreviationMatch(), "Algorithm and Data Structure", "ADS");
     }
 
     private static void fibonacci(String name, Fibonacci fibonacci) {
@@ -57,4 +60,12 @@ private static void lcs(String name, LongestCommonSubsequence subsequence, Strin
         System.out.println(prefix + "Val : " + d);
         System.out.println(prefix + "Cnt : " + counter);
     }
+
+    private static void match(String name, Match match, String pattern, String text) {
+        Counter counter = new Counter.Default();
+        String prefix = String.format("Rex.%s.", name);
+        var m = match.isMatch(pattern, text, counter);
+        System.out.println(prefix + "Val : " + m);
+        System.out.println(prefix + "Cnt : " + counter);
+    }
 }
diff --git a/vol7/src/main/java/ru/mifi/practice/vol7/wildcard/Match.java b/vol7/src/main/java/ru/mifi/practice/vol7/wildcard/Match.java
new file mode 100644
index 0000000..587ba6a
--- /dev/null
+++ b/vol7/src/main/java/ru/mifi/practice/vol7/wildcard/Match.java
@@ -0,0 +1,71 @@
+package ru.mifi.practice.vol7.wildcard;
+
+import ru.mifi.practice.vol7.Counter;
+
+public interface Match {
+    boolean isMatch(String pattern, String text, Counter counter);
+
+    final class DefaultMatch implements Match {
+
+        @Override
+        public boolean isMatch(String pattern, String text, Counter counter) {
+            int m = text.length();
+            int n = pattern.length();
+            boolean[][] table = new boolean[m + 1][n + 1];
+            table[0][0] = true;
+
+            for (int j = 1; j <= n; j++) {
+                if (pattern.charAt(j - 1) == '*') {
+                    table[0][j] = table[0][j - 1];
+                }
+            }
+
+            for (int i = 1; i <= m; i++) {
+                counter.increment();
+                for (int j = 1; j <= n; j++) {
+                    counter.increment();
+                    char textChar = text.charAt(i - 1);
+                    char patternChar = pattern.charAt(j - 1);
+
+                    if (patternChar == textChar || patternChar == '?') {
+                        table[i][j] = table[i - 1][j - 1];
+                    } else if (patternChar == '*') {
+                        table[i][j] = table[i - 1][j] || table[i][j - 1];
+                    } else {
+                        table[i][j] = false;
+                    }
+                }
+            }
+            return table[m][n];
+        }
+    }
+
+    final class AbbreviationMatch implements Match {
+
+        @Override
+        public boolean isMatch(String text, String abb, Counter counter) {
+            int n = text.length();
+            int m = abb.length();
+
+            boolean[][] table = new boolean[n + 1][m + 1];
+
+            table[0][0] = true;
+
+            for (int i = 0; i < n; i++) {
+                counter.increment();
+                for (int j = 0; j <= m; j++) {
+                    counter.increment();
+                    if (table[i][j]) {
+                        if (j < m && Character.toUpperCase(text.charAt(i)) == abb.charAt(j)) {
+                            table[i + 1][j + 1] = true;
+                        }
+                        if (Character.isLowerCase(text.charAt(i)) || Character.isWhitespace(text.charAt(i))) {
+                            table[i + 1][j] = true;
+                        }
+                    }
+                }
+            }
+            return table[n][m];
+        }
+    }
+}