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 Implement Suffix Tree
Java Program to Solve a Matching Problem for a Given Specific Case
Spring Boot Actuator
How to Find an Element in a List with Java
Spring Boot Tutorial – Bootstrap a Simple Application
Java Program to Find a Good Feedback Vertex Set
How to Kill a Java Thread
A Guide to TreeMap in Java
Java Program to Perform integer Partition for a Specific Case
Loại bỏ các phần tử trùng trong một ArrayList như thế nào?
Login For a Spring Web App – Error Handling and Localization
Iterable to Stream in Java
Checked and Unchecked Exceptions in Java
Java Program to Generate Date Between Given Range
Java Program to Implement Sorted Doubly Linked List
Spring Boot - Tomcat Port Number
Jackson – Change Name of Field
Một số tính năng mới về xử lý ngoại lệ trong Java 7
Jackson – Bidirectional Relationships
Assert an Exception is Thrown in JUnit 4 and 5
Java Program to Find Nearest Neighbor for Static Data Set
Zipping Collections in Java
Java Program to Implement WeakHashMap API
Registration – Activate a New Account by Email
Java Program to Implement Pairing Heap
Java Program to Implement Levenshtein Distance Computing Algorithm
Java Program to Implement Ternary Heap
The DAO with JPA and Spring
Tạo ứng dụng Java RESTful Client với thư viện Retrofit
Guide to Java 8 groupingBy Collector
Converting Between Byte Arrays and Hexadecimal Strings in Java
Different Ways to Capture Java Heap Dumps