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:
Hướng dẫn kết nối cơ sở dữ liệu với Java JDBC
Java Convenience Factory Methods for Collections
Converting Between Byte Arrays and Hexadecimal Strings in Java
A Guide to Concurrent Queues in Java
Các chương trình minh họa sử dụng Cấu trúc điều khiển trong Java
Java Program to Implement Borwein Algorithm
Java Program to Implement Queue
Getting the Size of an Iterable in Java
Java Program to Implement CountMinSketch
Java Program to Find MST (Minimum Spanning Tree) using Kruskal’s Algorithm
Assert an Exception is Thrown in JUnit 4 and 5
Spring @Primary Annotation
Java Program to Implement Booth Algorithm
Hướng dẫn Java Design Pattern – Facade
Java Program to Find k Numbers Closest to Median of S, Where S is a Set of n Numbers
Java Program to Implement the Hill Cypher
Returning Image/Media Data with Spring MVC
REST Web service: Upload và Download file với Jersey 2.x
Spring AMQP in Reactive Applications
Constructor Dependency Injection in Spring
Hướng dẫn Java Design Pattern – Mediator
Redirect to Different Pages after Login with Spring Security
Hướng dẫn Java Design Pattern – Memento
The Spring @Controller and @RestController Annotations
Collect a Java Stream to an Immutable Collection
Runnable vs. Callable in Java
Custom Exception trong Java
Guide to Spring 5 WebFlux
Java Program to Find All Pairs Shortest Path
Derived Query Methods in Spring Data JPA Repositories
Spring REST API + OAuth2 + Angular
REST Pagination in Spring