This is a java program to perform Naive String matching algorithm.
Here is the source code of the Java Program to Perform Naive String Matching. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
package com.maixuanviet.setandstring; import java.util.Scanner; public class StringSearchUsingNaiveMethod { private final int BASE; private int[] occurrence; private String pattern; public StringSearchUsingNaiveMethod(String pattern) { this.BASE = 256; this.pattern = pattern; occurrence = new int[BASE]; for (int c = 0; c < BASE; c++) occurrence = -1; for (int j = 0; j < pattern.length(); j++) occurrence[pattern.charAt(j)] = j; } public int search(String text) { int n = text.length(); int m = pattern.length(); int skip; for (int i = 0; i <= n - m; i += skip) { skip = 0; for (int j = m - 1; j >= 0; j--) { if (pattern.charAt(j) != text.charAt(i + j)) { skip = Math.max(1, j - occurrence[text.charAt(i + j)]); break; } } if (skip == 0) return i; } return n; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter the main string: "); String text = sc.nextLine(); System.out.print("Enter the string to be searched: "); String pattern = sc.nextLine(); StringSearchUsingNaiveMethod nsm = new StringSearchUsingNaiveMethod( pattern); int first_occur_position = nsm.search(text); System.out.println("The text '" + pattern + "' is first found after the " + first_occur_position + " position."); sc.close(); } }
Output:
$ javac StringSearchUsingNaiveMethod.java $ java StringSearchUsingNaiveMethod Enter the main string: Sanfoundry is No. 1 choice for Deep Hands-ON Trainings in SAN, Linux & C, Kernel & Device Driver Programming. Our Founder has trained employees of almost all Top Companies in India. Here are few of them: VMware, Citrix, Oracle, Motorola, Ericsson, Aricent, HP, Intuit, Microsoft, Cisco, SAP Labs, Siemens, Symantec, Redhat, Chelsio, Cavium Networks, ST Microelectronics, Samsung, LG-Soft, Wipro, TCS, HCL, IBM, Accenture, HSBC, Northwest Bank, Mphasis, Tata Elxsi, Tata Communications, Mindtree, Cognizant, mid size IT companies and many Startups. Students from top Universities and colleges such as NIT Trichy, BITS Pilani, University of California, Irvine, University of Texas, Austin & PESIT Bangalore have benefited a lot from these courses as well. The assignments and real time projects for our courses are of extremely high quality with excellent learning curve. Enter the string to be searched: No. 1 The text 'No. 1 ' is first found after the 14 position.
Related posts:
Tiêu chuẩn coding trong Java (Coding Standards)
Java Program to Solve Knapsack Problem Using Dynamic Programming
Java Program to Implement Weight Balanced Tree
Guide to BufferedReader
Map Serialization and Deserialization with Jackson
Convert Character Array to String in Java
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
Java Program to Perform Sorting Using B-Tree
Java Program to Perform Searching Using Self-Organizing Lists
Spring Boot - Enabling Swagger2
Simple Single Sign-On with Spring Security OAuth2
The Spring @Controller and @RestController Annotations
Sắp xếp trong Java 8
Spring Boot - Application Properties
Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree
HttpClient Connection Management
New Features in Java 14
Working with Tree Model Nodes in Jackson
Toán tử trong java
Java Program to Implement Gabow Algorithm
Date Time trong Java 8
Getting Started with Stream Processing with Spring Cloud Data Flow
Converting a List to String in Java
Java Program to Perform Insertion in a BST
HttpClient Timeout
Java Program to Find Minimum Element in an Array using Linear Search
Set Interface trong Java
Java Program to Implement the Alexander Bogomolny’s UnOrdered Permutation Algorithm for Elements Fro...
Hướng dẫn Java Design Pattern – Observer
Introduction to Spring Data JDBC
Java Program to Implement Shell Sort
Custom Error Pages with Spring MVC