Vfrdtyky

can you give me some pointers as of how can I find the most frequent word in an String? I cannot use Maps, lists or so on. I should only achieve this by for's and if's and some in-build methods.

Split String and save to array, sort the array, iterate over the sorted array and count frequency of same strings updating the maximal count. Example:

public static void main(String args) {

    String myStr = "how can I find the most frequent word in an string how can I find how how how string";

    String splited = myStr.split(" ");

    Arrays.sort(splited);

    System.out.println(Arrays.toString(splited));

    int max = 0;

    int count= 1;

    String word = splited[0];

    String curr = splited[0];

    for(int i = 1; i<splited.length; i++){

        if(splited[i].equals(curr)){

            count++;

        }

        else{

            count =1;

            curr = splited[i];

        }

        if(max<count){

            max = count;

            word = splited[i];

        }

    }

    System.out.println(max + " x " + word);

}  

Sample idea (there are thousand ways to solve this):

1: A B B C B (< String with words, seperated by blanks)
'A' is your start position

2: count the A (1) and save the pos of A (0). You always iterate from pos until the end of the String.

3: continue counting until you iterated over the entire String. When you reached the end of the String save the count by assigning it to another variable (e.g. oldCount).

4: move on to the next word and start counting B's (new position = 1). You are about to count 3 B's. If newer count > older count replace the older count.

5: count the next word and update the position to your current position, which is 3. (which is the last position of the String).

6: you are not gonna update the counter, B is the most used word in the String.

For the purists - just loops and String.

private String mostFrequentWord(String words) {

    // Where my current word starts.

    int wordStart = 0;

    // How many I counted.

    int wordCount = 0;

    // The currently most frequent.

    String word = "";

    for (int wordEnd = wordStart; wordEnd < words.length(); wordEnd++) {

        // Is this the end of a word?

        if (wordEnd > words.length() || words.charAt(wordEnd) == ' ') {

            // We have a word! How many times does it occur?

            String thisWord = words.substring(wordStart, wordEnd);

            // How many times this word occurs.

            int thisWordCount = 0;

            // Current start of search.

            int search = -1;

            // Count them.

            while ((search = words.indexOf(thisWord, search + 1)) >= 0) {

                thisWordCount += 1;

            }

            // Is it longer?

            if (thisWordCount > wordCount) {

                // Keep track.

                word = thisWord;

                wordCount = thisWordCount;

            }

            // Move start to the next word.

            wordStart = wordEnd + 1;

        }

    }

    return word;

}



private void test() {

    String words = "Now is the time for all good men to come to the aid of the party";

    System.out.println("Most frequent word in "" + words + "" is " + mostFrequentWord(words));

}

public static void main(String...strings) {

        String para = "Paris in the the spring.Not that that is related.Why are you laughing? Are my my regular expressions THAT bad??";

        String words = para.split("\s+");

        int finalCount = 0;

        int tempCount = 0;

        String mostlyUsedWord = null;

        for (String word: words) {

            tempCount = 0;

            for (String w: words) {

                if (word.equalsIgnoreCase(w)) {

                    tempCount++;

                }

            }

            if (tempCount >= finalCount) {

                finalCount = tempCount;

                mostlyUsedWord = word;

            }

        }

        System.out.println("mostlyUsedWord:: = " + mostlyUsedWord + " ,count:: = " + finalCount);

    }