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:
Java 8 Stream API Analogies in Kotlin
Abstract class và Interface trong Java
Java Program to Implement Bloom Filter
Java 8 Streams peek() API
Java 8 and Infinite Streams
A Guide to @RepeatedTest in Junit 5
Spring REST API + OAuth2 + Angular
Java Program to Implement Solovay Strassen Primality Test Algorithm
Java Program to Find ith Largest Number from a Given List Using Order-Statistic Algorithm
Giới thiệu thư viện Apache Commons Chain
Reading an HTTP Response Body as a String in Java
Predicate trong Java 8
RestTemplate Post Request with JSON
How to Change the Default Port in Spring Boot
Java Program to Implement Word Wrap Problem
Updating your Password
StringBuilder vs StringBuffer in Java
Spring Security Logout
Java Program to Solve Knapsack Problem Using Dynamic Programming
Loại bỏ các phần tử trùng trong một ArrayList như thế nào?
Java Program to Solve any Linear Equations
Java Program to Test Using DFS Whether a Directed Graph is Weakly Connected or Not
Introduction to Java Serialization
Java Program to Implement Leftist Heap
Using Spring @ResponseStatus to Set HTTP Status Code
Java Program to Generate Randomized Sequence of Given Range of Numbers
Mockito and JUnit 5 – Using ExtendWith
Java Program to Generate Random Numbers Using Middle Square Method
Sử dụng Fork/Join Framework với ForkJoinPool trong Java
Java Program to Find the Number of Ways to Write a Number as the Sum of Numbers Smaller than Itself
Dockerizing a Spring Boot Application
Java Program to Implement Fermat Factorization Algorithm