java program to count number of repeated words in a string without using hashmap – Programmerbay https://programmerbay.com A Tech Bay for Tech Savvy Sun, 27 Dec 2020 13:12:00 +0000 en-US hourly 1 https://wordpress.org/?v=6.5.5 https://programmerbay.com/wp-content/uploads/2019/09/cropped-without-transparent-32x32.jpg java program to count number of repeated words in a string without using hashmap – Programmerbay https://programmerbay.com 32 32 Java Program to Find Duplicate Words And Their Occurrences in String With or Without Using Map https://programmerbay.com/java-program-to-find-duplicate-words-and-their-occurrences-in-string-with-or-without-using-map/ https://programmerbay.com/java-program-to-find-duplicate-words-and-their-occurrences-in-string-with-or-without-using-map/#respond Sat, 27 Jun 2020 05:37:13 +0000 https://programmerbay.com/?p=6128 The program prints repeated words with number of occurrences in a given string using Map or without Map. It first creates an array from given string using split method and then after considers as any word duplicate if a word come atleast two times. For example, “blue sky and blue ocean” in this blue is repeating word with 2 times occurrence.

In this article, there are two ways used to achieve the solution, using Map and using String Array.

1. Java Program to find occurrences of the duplicate words in a sequence of string without using Map

Program:

class DuplicateWordsWithoutUsingMap {
    public static void main(String[] args) {
        String str = " this is is the word this is this";
        int count;
        String duplicates = "";
        String[] words = str.toLowerCase().trim().split(" ");
        for (int i = 0; i < words.length; i++) {
            count = 1;
            for (int j = i + 1; j < words.length; j++) {
                if (words[i].equals(words[j])) {
                    count++;
                }
            }
            if (count > 1) {
                if (duplicates.isEmpty()) {
                    duplicates += " " + words[i] + " : " + count;
                } else if (!duplicates.matches("(.*) " + words[i] + " (.*)")) {
                    duplicates += " " + words[i] + " : " + count;
                }
            }
        }
        System.out.println(duplicates);
    }
}

Output:

blo

 

2. Java Program to find occurrences of the duplicate words in a sequence string with the help of Map

Program:

class DuplicateWords {
    public static void main(String[] args) {
        String str = "This is a program to find duplicate words in a string, again! a program";
        String[] words = str.toLowerCase().trim().split(" ");
        Map<String, Integer> duplicateString = new HashMap<>();
        int count = 1;
        for (String x : words) {
            if (duplicateString.containsKey(x)) {
                duplicateString.put(x, duplicateString.get(x) + 1);
            } else {
                duplicateString.put(x, count);
            }
        }
        System.out.println("Duplicate Words in a String : ");
        for (Map.Entry a : duplicateString.entrySet()) {
            int val = (Integer) a.getValue();
            if (val > 1) {
                System.out.println(a);
            }
        }
    }
}

Output:

Duplicate Words in a String : 
a=3
program=2

]]>
https://programmerbay.com/java-program-to-find-duplicate-words-and-their-occurrences-in-string-with-or-without-using-map/feed/ 0