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 Longest Subsequence Common to All Sequences in a Set of Sequences
Java Program to Implement Max-Flow Min-Cut Theorem
Autoboxing và Unboxing trong Java
Form Validation with AngularJS and Spring MVC
Generate Spring Boot REST Client with Swagger
A Guide to the ResourceBundle
Java Program to Generate All Subsets of a Given Set in the Gray Code Order
Introduction to Java 8 Streams
Java NIO2 Path API
Getting Started with Stream Processing with Spring Cloud Data Flow
Fixing 401s with CORS Preflights and Spring Security
SOAP Web service: Upload và Download file sử dụng MTOM trong JAX-WS
LIKE Queries in Spring JPA Repositories
Extract links from an HTML page
Java Program to Check if a Matrix is Invertible
Spring Security – Reset Your Password
An Intro to Spring Cloud Security
Spring Boot - Actuator
Java Program to Perform Insertion in a BST
Template Engines for Spring
Spring Boot - Securing Web Applications
Java Program to Check whether Undirected Graph is Connected using BFS
Java Program to Implement Best-First Search
Introduction to Spring Cloud CLI
Predicate trong Java 8
Hướng dẫn sử dụng luồng vào ra ký tự trong Java
Java Program to Construct an Expression Tree for an Infix Expression
Guide To CompletableFuture
Jackson Unmarshalling JSON with Unknown Properties
Custom Thread Pools In Java 8 Parallel Streams
Rabin-Karp Algorithm for string matching
Java Convenience Factory Methods for Collections