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:
Abstract class và Interface trong Java
Java Program to Perform Searching Based on Locality of Reference
Spring Boot Configuration with Jasypt
Java Program to Implement Gabow Algorithm
Most commonly used String methods in Java
Check If Two Lists are Equal in Java
Giới thiệu java.io.tmpdir
New Features in Java 15
Hướng dẫn Java Design Pattern – MVC
Java Program to Perform Searching in a 2-Dimension K-D Tree
Phương thức tham chiếu trong Java 8 – Method References
Runnable vs. Callable in Java
Explain about URL and HTTPS protocol
New Features in Java 9
Guide to @JsonFormat in Jackson
Java Program to Implement Best-First Search
Java Program to Perform Encoding of a Message Using Matrix Multiplication
Java Program to Check if a Given Set of Three Points Lie on a Single Line or Not
Quick Guide to the Java StringTokenizer
Spring Boot - Runners
Java Byte Array to InputStream
Setting the Java Version in Maven
Java Program to Find the Shortest Path from Source Vertex to All Other Vertices in Linear Time
Annotation trong Java 8
Java Program to Find the Peak Element of an Array O(n) time (Naive Method)
Đồng bộ hóa các luồng trong Java
Java Map With Case-Insensitive Keys
Apache Commons Collections BidiMap
Getting the Size of an Iterable in Java
Java Program to Find the Connected Components of an UnDirected Graph
Java Program to Implement Sorted Circularly Singly Linked List
XML Serialization and Deserialization with Jackson