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:
Hướng dẫn sử dụng String Format trong Java
Java Program to Perform Searching Using Self-Organizing Lists
Spring 5 Testing with @EnabledIf Annotation
Spring Boot - Internationalization
Java InputStream to String
Java Program to Implement Sorting of Less than 100 Numbers in O(n) Complexity
Hướng dẫn Java Design Pattern – Flyweight
Java Program to Perform the Sorting Using Counting Sort
Java Program to Solve a Matching Problem for a Given Specific Case
Java Program to Implement Borwein Algorithm
Java NIO2 Path API
Constructor Injection in Spring with Lombok
Using Custom Banners in Spring Boot
ExecutorService – Waiting for Threads to Finish
Hướng dẫn Java Design Pattern – Template Method
Java Program to Implement Sorted Circular Doubly Linked List
Spring WebFlux Filters
Java Program to Implement Cartesian Tree
Giới thiệu Aspect Oriented Programming (AOP)
Overview of the java.util.concurrent
Period and Duration in Java
Java Program to Implement Interpolation Search Algorithm
Marker Interface trong Java
Converting a Stack Trace to a String in Java
Mệnh đề Switch-case trong java
Chuyển đổi từ HashMap sang ArrayList
Java Program to Implement Dijkstra’s Algorithm using Set
Java Program to Perform Left Rotation on a Binary Search Tree
How to Break from Java Stream forEach
Convert Hex to ASCII in Java
Java Program to Implement the Hungarian Algorithm for Bipartite Matching
Function trong Java 8