update at 2022-03-12 16:13:15 by ehlxr

2022-03-12 16:13:15 +08:00 · 2022-03-12 16:13:15 +08:00 · 6cfb4fd37e
commit 6cfb4fd37e
parent 4c3ee5fcf4
1 changed files with 65 additions and 0 deletions
--- a/budd-common/src/main/java/io/github/ehlxr/algorithm/match/BruteForce.java
+++ b/budd-common/src/main/java/io/github/ehlxr/algorithm/match/BruteForce.java
@ -0,0 +1,65 @@
+/*
+ * The MIT License (MIT)
+ *
+ * Copyright © 2020 xrv <xrg@live.com>
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+package io.github.ehlxr.algorithm.match;
+
+/**
+ * 字符串匹配：暴力匹配
+ *
+ * @author ehlxr
+ * @since 2022-03-12 13:36.
+ */
+public class BruteForce {
+    public static void main(String[] args) {
+        String s = "abdcfhjudfadf";
+        String p = "dcf";
+
+        System.out.println(match(s, p));
+    }
+
+    public static int match(String s, String p) {
+        int sl = s.length();
+        int pl = p.length();
+
+        if (sl <= pl && !s.equals(p)) {
+            return -1;
+        }
+
+        for (int i = 0; i <= sl - pl; i++) {
+            int j = 0;
+            for (; j < pl; j++) {
+                if (s.charAt(i) == p.charAt(j)) {
+                    i++;
+                } else {
+                    break;
+                }
+            }
+            if (j == pl) {
+                return i - pl;
+            }
+        }
+
+        return -1;
+    }
+}