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:
Refactoring Design Pattern với tính năng mới trong Java 8
Java Program to Perform Optimal Paranthesization Using Dynamic Programming
Spring 5 Testing with @EnabledIf Annotation
Converting Between an Array and a Set in Java
Truyền giá trị và tham chiếu trong java
Loại bỏ các phần tử trùng trong một ArrayList như thế nào?
Guide to the Volatile Keyword in Java
Java Program to Implement a Binary Search Tree using Linked Lists
Flattening Nested Collections in Java
DistinctBy in the Java Stream API
An Intro to Spring Cloud Contract
Automatic Property Expansion with Spring Boot
Java Program to Find Number of Spanning Trees in a Complete Bipartite Graph
Java Program to Implement Graham Scan Algorithm to Find the Convex Hull
Java Program to Implement the Monoalphabetic Cypher
Spring Boot - Web Socket
Jackson Exceptions – Problems and Solutions
Java Program to Implement Sorted Array
Java Program to Generate All Pairs of Subsets Whose Union Make the Set
Java Program to Use the Bellman-Ford Algorithm to Find the Shortest Path
Circular Dependencies in Spring
Unsatisfied Dependency in Spring
Một số ký tự đặc biệt trong Java
Exploring the Spring 5 WebFlux URL Matching
Consuming RESTful Web Services
Java Program to Implement Shell Sort
Logging a Reactive Sequence
Guava – Join and Split Collections
Convert char to String in Java
Luồng Daemon (Daemon Thread) trong Java
Java 8 StringJoiner
Java Program to Find Nearest Neighbor Using Linear Search