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:
A Guide to Java HashMap
Java Stream Filter with Lambda Expression
Jackson vs Gson
Java Program to Implement Gauss Jordan Elimination
Java Program to Implement Regular Falsi Algorithm
Spring Boot - Application Properties
Marker Interface trong Java
Java Program to Implement LinkedBlockingQueue API
Query Entities by Dates and Times with Spring Data JPA
How to Replace Many if Statements in Java
Custom Error Pages with Spring MVC
How to Return 404 with Spring WebFlux
Java Program to Search Number Using Divide and Conquer with the Aid of Fibonacci Numbers
Spring Data Java 8 Support
Phương thức tham chiếu trong Java 8 – Method References
Java Program to Implement Best-First Search
Java Program to Implement Quick Sort Using Randomization
Java – Write an InputStream to a File
Test a REST API with Java
Why String is Immutable in Java?
Hướng dẫn kết nối cơ sở dữ liệu với Java JDBC
Consuming RESTful Web Services
Java Program to Implement ArrayDeque API
Comparing Two HashMaps in Java
Java Program to Implement Interpolation Search Algorithm
Câu lệnh điều khiển vòng lặp trong Java (break, continue)
New Features in Java 15
Basic Authentication with the RestTemplate
OAuth2 for a Spring REST API – Handle the Refresh Token in AngularJS
How to Change the Default Port in Spring Boot
Quick Guide to Spring Bean Scopes
Java Program to Check whether Graph is a Bipartite using 2 Color Algorithm