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:
Giới thiệu về Stream API trong Java 8
Java Program to Create a Minimal Set of All Edges Whose Addition will Convert it to a Strongly Conne...
OAuth2.0 and Dynamic Client Registration
Java Program to Implement Quick Sort with Given Complexity Constraint
Zipping Collections in Java
Send an email using the SMTP protocol
String Operations with Java Streams
Java Program to Test Using DFS Whether a Directed Graph is Strongly Connected or Not
Spring Boot - Google OAuth2 Sign-In
Jackson – Marshall String to JsonNode
Java Program to Implement Segment Tree
Spring Security – security none, filters none, access permitAll
Java Program to Implement Flood Fill Algorithm
Java Program to Implement Hash Tables Chaining with Doubly Linked Lists
Difference Between Wait and Sleep in Java
Java Program to Perform Searching Using Self-Organizing Lists
New Features in Java 15
Java Program to Implement Lloyd’s Algorithm
Java Program to Solve a Matching Problem for a Given Specific Case
Guide to Apache Commons CircularFifoQueue
Guide to Guava Table
Java Program to Perform Sorting Using B-Tree
Spring Boot - Rest Controller Unit Test
Immutable ArrayList in Java
Spring Data Reactive Repositories with MongoDB
Spring MVC Setup with Kotlin
Phân biệt JVM, JRE, JDK
The Order of Tests in JUnit
Java Program to Check Whether a Weak Link i.e. Articulation Vertex Exists in a Graph
Spring Boot - Building RESTful Web Services
Database Migrations with Flyway
Summing Numbers with Java Streams