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 – String to Reader
Java Program to Implement JobStateReasons API
Java – Write a Reader to File
How to Break from Java Stream forEach
Comparing Objects in Java
Java – Reader to Byte Array
Registration – Password Strength and Rules
Debugging Reactive Streams in Java
Creating a Custom Starter with Spring Boot
Java Program to Implement Merge Sort on n Numbers Without tail-recursion
Java Program to Perform Right Rotation on a Binary Search Tree
Java Program to Implement Ternary Tree
Creating Docker Images with Spring Boot
Hướng dẫn Java Design Pattern – Observer
Java Program to Implement wheel Sieve to Generate Prime Numbers Between Given Range
A Custom Media Type for a Spring REST API
Java – Reader to InputStream
Spring Security Remember Me
Guide to the Java ArrayList
Java Program to Implement Skew Heap
Java Program to Represent Graph Using Incidence Matrix
Java Program to Represent Linear Equations in Matrix Form
Java Program to Implement Graham Scan Algorithm to Find the Convex Hull
Java Program to Generate All Possible Combinations Out of a, b, c, d, e
Java Program to Implement Ternary Search Algorithm
Tạo ứng dụng Java RESTful Client với thư viện OkHttp
Chuyển đổi Array sang ArrayList và ngược lại
Java CyclicBarrier vs CountDownLatch
Guide to the Java Queue Interface
TreeSet và sử dụng Comparable, Comparator trong java
Quick Guide to java.lang.System
Java Program to Implement Multi-Threaded Version of Binary Search Tree