Getting the count of duplicate values in arrayList in Java without affecting the order of arrayList

Question

I am trying to get the count of duplicate values of String ArrayList, i have achieved the task but not completely. i am able to get the counts of duplicate elements of my arrayList, but the problem is that the order of arrayList destroys when i get the occurrences of elements

here is my code:

    Map<String, Integer> counts = new HashMap<String, Integer>();

    for (String str : t.courseName) {
        if (counts.containsKey(str)) {
            counts.put(str, counts.get(str) + 1);
        } else {
            counts.put(str, 1);
        }
    }

    for (Map.Entry<String, Integer> entry : counts.entrySet()) {
        System.out.println(entry.getKey() + " = " + entry.getValue());
    }

this code works fine for getting occurrences but note that this code destroys the order. what i want is that the order should also not be destroyed.

If you are using java 8 your if-else statement can be simplified to `counts.merge(str, 1, Integer::sum);`. — cpp beginner, Dec 29 '16 at 13:11

sidgate · Accepted Answer · 2016-12-29T13:03:20.547

1

Use LinkedHashMap instead of HashMap to preserve the insertion order

A LinkedHashMap is a combination of hash table and linked list. It has a predictable iteration order (a la linked list), yet the retrieval speed is that of a HashMap. The order of the iteration is determined by the insertion order, so you will get the key/values back in the order that they were added to this Map.

edited Dec 29 '16 at 13:03

answered Dec 29 '16 at 13:01

sidgate

14,650
11
68
119

thanks!! you saved my day!! it worked fine – Muhammad Yawar Dec 29 '16 at 13:03

Getting the count of duplicate values in arrayList in Java without affecting the order of arrayList

1 Answers1