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:
Registration – Activate a New Account by Email
Queue và PriorityQueue trong Java
New Features in Java 9
Overview of the java.util.concurrent
Create a Custom Auto-Configuration with Spring Boot
Supplier trong Java 8
Hướng dẫn Java Design Pattern – Decorator
Toán tử trong java
Java Program to Find the Peak Element of an Array O(n) time (Naive Method)
Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree
Java Program to Remove the Edges in a Given Cyclic Graph such that its Linear Extension can be Found
Checking for Empty or Blank Strings in Java
A Guide to the Java LinkedList
Spring Boot Configuration with Jasypt
Sử dụng CountDownLatch trong Java
Java Program to Represent Graph Using 2D Arrays
Java Program to Implement Randomized Binary Search Tree
Count Occurrences of a Char in a String
Updating your Password
Implementing a Binary Tree in Java
Exploring the Spring 5 WebFlux URL Matching
Java Program to Solve the Fractional Knapsack Problem
Java Program to Implement Aho-Corasick Algorithm for String Matching
Java Program to Perform Arithmetic Operations on Numbers of Size
RestTemplate Post Request with JSON
Java Program to Implement IdentityHashMap API
Java Program to Implement PrinterStateReasons API
Spring WebClient Filters
Java Program to Generate Randomized Sequence of Given Range of Numbers
Error Handling for REST with Spring
Hướng dẫn Java Design Pattern – Proxy
Servlet 3 Async Support with Spring MVC and Spring Security