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:
Receive email using IMAP
Java Program to Implement Variable length array
Java Program to Check the Connectivity of Graph Using DFS
Sort a HashMap in Java
Inject Parameters into JUnit Jupiter Unit Tests
ExecutorService – Waiting for Threads to Finish
Notify User of Login From New Device or Location
Get the workstation name or IP
Spring Boot Security Auto-Configuration
Java Program to Implement Maximum Length Chain of Pairs
Java Program to Represent Graph Using Adjacency Matrix
Hướng dẫn Java Design Pattern – Prototype
Supplier trong Java 8
Java CyclicBarrier vs CountDownLatch
Java Program to Find Transitive Closure of a Graph
Enum trong java
Spring Boot - Rest Controller Unit Test
Java Program to Describe the Representation of Graph using Incidence Matrix
Java Program to Implement Miller Rabin Primality Test Algorithm
Các nguyên lý thiết kế hướng đối tượng – SOLID
Java Program to Check whether Graph is Biconnected
Spring Cloud AWS – RDS
Flattening Nested Collections in Java
Java Program to Implement Weight Balanced Tree
Java Program to Check if an UnDirected Graph is a Tree or Not Using DFS
Từ khóa this và super trong Java
Java Program to Implement the One Time Pad Algorithm
Working with Network Interfaces in Java
Java Program to Implement Control Table
Java Program to Perform String Matching Using String Library
Java Program to Generate All Pairs of Subsets Whose Union Make the Set
How to Get the Last Element of a Stream in Java?