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:
Java Program to find the maximum subarray sum O(n^2) time(naive method)
Login For a Spring Web App – Error Handling and Localization
Java Program to Implement the Hill Cypher
Lập trình đa luồng với CompletableFuture trong Java 8
Hướng dẫn Java Design Pattern – Iterator
Java 9 Stream API Improvements
Java Program to Check the Connectivity of Graph Using BFS
Java Program to Describe the Representation of Graph using Incidence Matrix
Hướng dẫn Java Design Pattern – Transfer Object
Spring Cloud Bus
Spring Security Remember Me
Hướng dẫn Java Design Pattern – Template Method
A Custom Data Binder in Spring MVC
A Guide to Queries in Spring Data MongoDB
Java Program to Implement Extended Euclid Algorithm
Zipping Collections in Java
Model, ModelMap, and ModelAndView in Spring MVC
Giới thiệu SOAP UI và thực hiện test Web Service
Spring Boot - Servlet Filter
Constructor Dependency Injection in Spring
Java Program to Convert a Decimal Number to Binary Number using Stacks
Getting Started with Custom Deserialization in Jackson
How to Break from Java Stream forEach
Java Program to implement Priority Queue
Java Program to Implement Patricia Trie
Java Program to Implement Randomized Binary Search Tree
Java Program to Represent Linear Equations in Matrix Form
Java TreeMap vs HashMap
Java IO vs NIO
Java Switch Statement
Java Program to Check if it is a Sparse Matrix
Java Program to Decode a Message Encoded Using Playfair Cipher