Salve, lo scopo di questa classe è calcolare il numero di occorrenze di tutte le possibili parole di n caratteri all'interno di un testo; c'è un problema perchè ottengo il risultato 228 per tutte le parole, credo che l'errore sia all'interno del metodo occorrenceNumber ma non riesco a individuarlo
import java.io.*;
import java.util.*;
public class Test {
public static void main(String[] args) {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter the integer n");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
char[] array = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z', ' '}; // our alphabet inlcudes the blank too
StringBuffer[] table = createTotalTable(n, array);
System.out.println("Enter the text ");
StringBuffer text = new StringBuffer("");
try {
text = new StringBuffer(in.readLine());
}catch(IOException a){
System.out.println("Input-Output problem");
}
StringBuffer text_formatted = format(text.toString());
System.out.println("The formatted text is \n" + text_formatted.toString() + "\n");
System.out.println("Now we print all the n-character words in alphabetic order. Press enter to proceed. ");
try {
in.readLine();
}catch(IOException b){
System.out.println("Input-Output problem");
}
for (StringBuffer word : table)
System.out.println(word.toString());
int[] occurrenceTable = createList(text_formatted, table, n);
System.out.println("Now we print all the n-words contained in the text with the number of occurrences. Press enter to proceed.");
try {
in.readLine();
}catch(IOException c){
System.out.println("Input-Output problem");
}
for(int u = 0; u < pow(27, n); u++)
System.out.println(table[u].toString() + ", " + occurrenceTable[u]);
sc.close();
}
public static StringBuffer[] createTotalTable(int n, char[] a) { // this method create an array containing all the n-words in alphabetic order
StringBuffer[] table = new StringBuffer[ pow(27, n)];
for(int w =0; w < pow(27, n); w++)
table[w] = new StringBuffer("");
for(int h = 1; h <= n ; h++){
for(int u =0; u < pow ( 27, h-1); u++){
for (int j = 0; j<27; j++){
for( int x =pow(27, n-h+1)*u + pow(27, n-h)*j; x< pow(27, n-h+1)*u + pow(27, n-h)*(j+1); x++)
table[x] = table[x].append(a[j]);
}
}
}
return table;
}
public static int pow(int a, int b){ // the method Math.pow modified
int tot = 1;
for(int i =0; i<b ; i++)
tot = a * tot ;
return tot;
}
public static int occurrenceNumber ( StringBuffer testo, StringBuffer parola, int n){ // this method is aimed to calculate the number of occurrences of a word of length n in a text
int tot =0;
if(n > testo.length())
System.out.println("The integer is bigger than the text's length ");
else{
for(int i = 0; i <= testo.length() - n; i++ ){
if((testo.substring(i,i+n)).equals(parola.toString()));
tot += 1;
}
}
return tot;
}
public static int[] createList (StringBuffer str , StringBuffer[] tabella, int n){ // this method is aimed to create an array containing for every position the number of occurrences of the corresponding word in the text
int[] occurrenceTable = new int[pow(27,n)];
for(int i =0; i < pow(27, n); i++ )
occurrenceTable[i] = occurrenceNumber(str, tabella[i], n);
return occurrenceTable;
}
public static StringBuffer format (String s){ // this method is aimed to eliminate non-alphabetic characters and multiple spaces
s = s.toLowerCase();
StringBuffer b = new StringBuffer();
int m = s.length();
int conta_spazi = 0;
StringBuffer h = new StringBuffer(s);
for (int i = 0; i < m ; i++ ){
switch(h.charAt(i)) {
case 'a':
break;
case 'A':
break;
case 'b':
break;
case 'B':
break;
case 'c':
break;
case 'C':
break;
case 'd':
break;
case 'D':
break;
case 'e':
break;
case 'E':
break;
case 'f':
break;
case 'F':
break;
case 'g':
break;
case 'G':
break;
case 'h':
break;
case 'H':
break;
case 'i':
break;
case 'I':
break;
case 'j':
break;
case 'J':
break;
case 'k':
break;
case 'K':
break;
case 'l':
break;
case 'L':
break;
case 'm':
break;
case 'M':
break;
case 'n':
break;
case 'N':
break;
case 'o':
break;
case 'O':
break;
case 'p':
break;
case 'P':
break;
case 'q':
break;
case 'Q':
break;
case 'r':
break;
case 'R':
break;
case 's':
break;
case 'S':
break;
case 't':
break;
case 'T':
break;
case 'u':
break;
case 'U':
break;
case 'v':
break;
case 'V':
break;
case 'w':
break;
case 'W':
break;
case 'x':
break;
case 'X':
break;
case 'y':
break;
case 'Y':
break;
case 'z':
break;
case 'Z':
break;
default:
h.setCharAt(i, ' ');
}
}
for (int i = 0; i < m ; i++ ){
if ( h.charAt(i) == ' ' )
conta_spazi++;
else
conta_spazi = 0;
if ( conta_spazi <= 1)
b = b.append(h.charAt(i));
}
return b;
}
}