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

style: enable ConstantName in checkstyle (#5139)

Browse Source 
Co-authored-by: Maria Paszkiewicz SCC <maria.paszkiewicz@kit.edu>
This commit is contained in:
marysiuniq
2024-05-02 18:31:37 +02:00
committed by GitHub
parent ede3e4651f
commit 1e2d7e9431
16 changed files with 87 additions and 90 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/main/java/com/thealgorithms/others/Conway.java
View File

@ -13,7 +13,7 @@ public class Conway {
*1s, two 2s, one 1" or 312211. https://en.wikipedia.org/wiki/Look-and-say_sequence
* */
private static final StringBuilder builder = new StringBuilder();
private static final StringBuilder BUILDER = new StringBuilder();
protected static List<String> generateList(String originalString, int maxIteration) {
List<String> numbers = new ArrayList<>();
@ -25,9 +25,9 @@ public class Conway {
}
public static String generateNextElement(String originalString) {
builder.setLength(0);
BUILDER.setLength(0);
String[] stp = originalString.split("(?<=(.))(?!\\1)");
Arrays.stream(stp).forEach(s -> builder.append(s.length()).append(s.charAt(0)));
return builder.toString();
Arrays.stream(stp).forEach(s -> BUILDER.append(s.length()).append(s.charAt(0)));
return BUILDER.toString();
}
}

18
src/main/java/com/thealgorithms/others/RabinKarp.java
View File

@ -9,15 +9,15 @@ import java.util.Scanner;
// Program will simply end if there is no match
public class RabinKarp {
public static Scanner scanner = null;
public static final int d = 256;
public static Scanner SCANNER = null;
public static final int ALPHABET_SIZE = 256;
public static void main(String[] args) {
scanner = new Scanner(System.in);
SCANNER = new Scanner(System.in);
System.out.println("Enter String");
String text = scanner.nextLine();
String text = SCANNER.nextLine();
System.out.println("Enter pattern");
String pattern = scanner.nextLine();
String pattern = SCANNER.nextLine();
int q = 101;
searchPat(text, pattern, q);
@ -32,14 +32,14 @@ public class RabinKarp {
int j = 0;
int i = 0;
h = (int) Math.pow(d, m - 1) % q;
h = (int) Math.pow(ALPHABET_SIZE, 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;
p = (ALPHABET_SIZE * p + pattern.charAt(i)) % q;
t = (ALPHABET_SIZE * t + text.charAt(i)) % q;
}
for (i = 0; i <= n - m; i++) {
@ -67,7 +67,7 @@ public class RabinKarp {
// 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;
t = (ALPHABET_SIZE * (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) {