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 Check if a Directed Graph is a Tree or Not Using DFS
Java Program to Create a Random Linear Extension for a DAG
Java Program to Implement Counting Sort
Java Program to Check whether Graph is a Bipartite using BFS
Java Program to find the number of occurrences of a given number using Binary Search approach
Biến trong java
Lấy ngày giờ hiện tại trong Java
String Initialization in Java
Limiting Query Results with JPA and Spring Data JPA
Uploading MultipartFile with Spring RestTemplate
Form Validation with AngularJS and Spring MVC
Java Program for Topological Sorting in Graphs
Spring AMQP in Reactive Applications
HttpClient Timeout
Converting Between a List and a Set in Java
Programmatic Transaction Management in Spring
Build a REST API with Spring and Java Config
Hướng dẫn Java Design Pattern – Singleton
Database Migrations with Flyway
Checking for Empty or Blank Strings in Java
Java Scanner hasNext() vs. hasNextLine()
Rate Limiting in Spring Cloud Netflix Zuul
Template Engines for Spring
Guide To CompletableFuture
Mảng (Array) trong Java
Java Program to Implement Threaded Binary Tree
Getting Started with GraphQL and Spring Boot
Tìm hiểu cơ chế Lazy Evaluation của Stream trong Java 8
Java 9 Stream API Improvements
Chuyển đổi từ HashMap sang ArrayList
Map Serialization and Deserialization with Jackson
Java Program to Implement Heap