Determines the number of repeating elements in an array or collection.

When we need to repeat the number of elements in an array or set, we might as well use map to do this.

Since the key in the map is unique, it is possible to use this feature to count repeating elements in the array.

The Java implementation code is as follows.

String[] names={"A", "B", "A", "B", "C"};

Map<string,integer> sameelement=new hashmap<string,integer> ();
for (int i=0,k=names.length;i<k;i++) {
Integer Sum=sameelement.get (Names[i]);
Sameelement.put (Names[i], sum==null?1:sum+1);
}
For (map.entry<string, integer> entry:sameElement.entrySet ()) {
System.out.println (Entry.getkey () + "number is:" +entry.getvalue ());
}

The above is done by consulting the API and reading the predecessors ' masterpieces. If there are deficiencies, please advise.

Mutual encouragement, study hard, progress together, thank you!

The

Determines the number of repeating elements in an array or collection.