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:
Phân biệt JVM, JRE, JDK
OAuth2 Remember Me with Refresh Token
A Guide to BitSet in Java
Ignore Null Fields with Jackson
Guide to java.util.concurrent.Locks
How to Delay Code Execution in Java
Sắp xếp trong Java 8
Java Program to Check if a Matrix is Invertible
Java Program to Find the Shortest Path Between Two Vertices Using Dijkstra’s Algorithm
Spring Boot Actuator
Using Custom Banners in Spring Boot
Java Program to Implement AA Tree
Java Program to Represent Graph Using Incidence Matrix
Hướng dẫn tạo và sử dụng ThreadPool trong Java
Một số từ khóa trong Java
Custom Thread Pools In Java 8 Parallel Streams
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
Constructor Dependency Injection in Spring
Sử dụng Fork/Join Framework với ForkJoinPool trong Java
Spring Cloud Bus
Assert an Exception is Thrown in JUnit 4 and 5
Java Program to Implement Naor-Reingold Pseudo Random Function
Java Program to Check if a Given Set of Three Points Lie on a Single Line or Not
Introduction to Using Thymeleaf in Spring
Introduction to Using FreeMarker in Spring MVC
Spring Security 5 – OAuth2 Login
RestTemplate Post Request with JSON
Java Program to Implement Segment Tree
Guide to CountDownLatch in Java
Java Program to Implement Cubic convergence 1/pi Algorithm
Java Program to Implement a Binary Search Algorithm for a Specific Search Sequence
Introduction to Java Serialization