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:
Uploading MultipartFile with Spring RestTemplate
Java Program to implement Bit Matrix
Spring REST API + OAuth2 + Angular
Copy a List to Another List in Java
Java Program to Perform String Matching Using String Library
Java InputStream to Byte Array and ByteBuffer
Java – Write a Reader to File
Functional Interfaces in Java 8
Java Program to Implement Double Order Traversal of a Binary Tree
Java Program to Implement Disjoint Sets
Java Convenience Factory Methods for Collections
Java Program to Implement Extended Euclid Algorithm
An Example of Load Balancing with Zuul and Eureka
Java Program to Create a Random Linear Extension for a DAG
Tính kế thừa (Inheritance) trong java
The Basics of Java Security
Giới thiệu Google Guice – Injection, Scope
Java Program to Perform the Sorting Using Counting Sort
Giới thiệu HATEOAS
Guide to Character Encoding
Kết hợp Java Reflection và Java Annotations
Java Program to Perform Polygon Containment Test
The HttpMediaTypeNotAcceptableException in Spring MVC
Guide to Spring Cloud Kubernetes
Hướng dẫn Java Design Pattern – Composite
Spring Cloud – Bootstrapping
Transactions with Spring and JPA
Java Program to Implement Pairing Heap
How to Count Duplicate Elements in Arraylist
Java Program to Perform Searching Based on Locality of Reference
Java Program to Implement Cubic convergence 1/pi Algorithm
Java Program to Repeatedly Search the Same Text (such as Bible by building a Data Structure)