algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-22 03:24:57 +08:00
Code Issues Packages Projects Releases Wiki Activity

Formatted with Google Java Formatter

Browse Source
This commit is contained in:
github-actions
2020-10-24 10:23:28 +00:00
parent a23bac99e8
commit 5d59a2e828
219 changed files with 13758 additions and 14582 deletions
Download Patch File Download Diff File Expand all files Collapse all files

125
Others/RabinKarp.java
View File

@ -1,84 +1,79 @@
/**
* @author Prateek Kumar Oraon (https://github.com/prateekKrOraon)
*/
/** @author Prateek Kumar Oraon (https://github.com/prateekKrOraon) */
import java.util.Scanner;
import java.lang.Math;
//An implementation of Rabin-Karp string matching algorithm
//Program will simply end if there is no match
// An implementation of Rabin-Karp string matching algorithm
// Program will simply end if there is no match
public class RabinKarp {
public static Scanner scanner = null;
public final static int d = 256;
public static Scanner scanner = null;
public static final int d = 256;
public static void main(String[] args){
public static void main(String[] args) {
scanner = new Scanner(System.in);
System.out.println("Enter String");
String text = scanner.nextLine();
System.out.println("Enter pattern");
String pattern = scanner.nextLine();
scanner = new Scanner(System.in);
System.out.println("Enter String");
String text = scanner.nextLine();
System.out.println("Enter pattern");
String pattern = scanner.nextLine();
int q = 101;
searchPat(text,pattern,q);
int q = 101;
searchPat(text, pattern, q);
}
private static void searchPat(String text, String pattern, int q) {
int m = pattern.length();
int n = text.length();
int t = 0;
int p = 0;
int h = 1;
int j = 0;
int i = 0;
h = (int) Math.pow(d, m - 1) % q;
for (i = 0; i < m; i++) {
// hash value is calculated for each character and then added with the hash value of the next
// character for pattern
// as well as the text for length equal to the length of pattern
p = (d * p + pattern.charAt(i)) % q;
t = (d * t + text.charAt(i)) % q;
}
private static void searchPat(String text, String pattern, int q) {
for (i = 0; i <= n - m; i++) {
int m = pattern.length();
int n = text.length();
int t = 0;
int p = 0;
int h = 1;
int j = 0;
int i = 0;
// if the calculated hash value of the pattern and text matches then
// all the characters of the pattern is matched with the text of length equal to length of the
// pattern
// if all matches then pattern exist in string
// if not then the hash value of the first character of the text is subtracted and hash value
// of the next character after the end
// of the evaluated characters is added
if (p == t) {
h = (int)Math.pow(d,m-1)%q;
// if hash value matches then the individual characters are matched
for (j = 0; j < m; j++) {
for(i =0 ; i< m; i++){
//hash value is calculated for each character and then added with the hash value of the next character for pattern
// as well as the text for length equal to the length of pattern
p = (d*p + pattern.charAt(i))%q;
t = (d*t + text.charAt(i))%q;
// if not matched then break out of the loop
if (text.charAt(i + j) != pattern.charAt(j)) break;
}
for(i=0; i<=n-m;i++){
//if the calculated hash value of the pattern and text matches then
//all the characters of the pattern is matched with the text of length equal to length of the pattern
//if all matches then pattern exist in string
//if not then the hash value of the first character of the text is subtracted and hash value of the next character after the end
//of the evaluated characters is added
if(p==t){
//if hash value matches then the individual characters are matched
for(j=0;j<m;j++){
//if not matched then break out of the loop
if(text.charAt(i+j) != pattern.charAt(j))
break;
}
//if all characters are matched then pattern exist in the string
if (j==m){
System.out.println("Pattern found at index " + i);
}
}
//if i<n-m then hash value of the first character of the text is subtracted and hash value of the next character after the end
//of the evaluated characters is added to get the hash value of the next window of characters in the text
if ( i < n-m )
{
t = (d*(t - text.charAt(i)*h) + text.charAt(i+m))%q;
//if hash value becomes less than zero than q is added to make it positive
if (t < 0)
t = (t + q);
}
// if all characters are matched then pattern exist in the string
if (j == m) {
System.out.println("Pattern found at index " + i);
}
}
// if i<n-m then hash value of the first character of the text is subtracted and hash value of
// the next character after the end
// of the evaluated characters is added to get the hash value of the next window of characters
// in the text
if (i < n - m) {
t = (d * (t - text.charAt(i) * h) + text.charAt(i + m)) % q;
// if hash value becomes less than zero than q is added to make it positive
if (t < 0) t = (t + q);
}
}
}
}