CODEWITHSUNDEEP
javaarraylist
user4028417
user4028417

Reputation:

find the most and least used string in an ArrayList (without using Hashmap)

I am having trouble finding the most and least used String in an ArrayList. The program should go through a file of Strings and count how many multiple strings there are in the list. Then print the least and most used name in the list. The ArrayList Part is finished. It is just finding the most and least common name I am having trouble with. I have no idea how to even start with it. I have tried asking but I got it in HashMap form. I kind of tried to figure it out but this is all I could think of.

for (int i = 0; i< dogs.size(); i++)
if dogs.get(0).getName().equals dogs.get(i).getName();
{
   dogs.get(i).getName()++;    
 }

Upvotes: 0

Views: 572

Answers (3)

Marko Topolnik
Marko Topolnik

Reputation: 200158

This is how you would solve your problem by relying on Java Streams API:

final SortedSet<Entry<String, Long>> s =
    lineList.stream().collect(groupingBy(identity(), counting())).entrySet()
    .stream().collect(toCollection(()->new TreeSet<>(comparing(Entry::getValue))));
System.out.println(s.first() + ", " + s.last());

Or, if you can start over from the point where you read the file, this would be better because it skips the step where you first create a list of lines and goes directly to constructing the frequency map:

try (BufferedReader r = Files.newBufferedReader(Paths.get("input.txt"))) {
  final SortedSet<Entry<String, Long>> s =
      r.lines().collect(groupingBy(identity(), counting())).entrySet().stream()
      .collect(toCollection(()->new TreeSet<>(comparing(Entry::getValue))));
  System.out.println(s.first() + ", " + s.last());
}

Note: this is the list of static imports needed by the above code:

import static java.util.Comparator.comparing;
import static java.util.function.Function.identity;
import static java.util.stream.Collectors.counting;
import static java.util.stream.Collectors.groupingBy;
import static java.util.stream.Collectors.toCollection;

Upvotes: 0

Enermis
Enermis

Reputation: 697

You could sort the list first and then count the amount of same consecutive names. Then only keep the smallest and the largest number..

ofcource hashmaps are ideal for this kind of problem and unless there is a really good reason why you can't use one you should use a hashmap for this

Upvotes: 2

Ruchira Gayan Ranaweera
Ruchira Gayan Ranaweera

Reputation: 35557

You can use frequency()

Eg:

 List<String> myList=new ArrayList<>();
 myList.add("a");
 myList.add("b");
 myList.add("a");
  for(String i:new HashSet<>(myList)){
     System.out.println(i+" has "+Collections.frequency(myList,i)+" times ");
  }

Out put:

 b has 1 times 
 a has 2 times

You can apply this to find most and lowest occurrence.

Or you can use HashMap.

  List<String> myList = new ArrayList<>();
  myList.add("a");
  myList.add("b");
  myList.add("a");
    Map<String, Integer> map = new HashMap<>();
    for (String i : new HashSet<>(myList)) {
        Integer val = map.get(i);
        if (val != null) {
            map.put(i, val + 1);
        } else {
            map.put(i, 1);
        }
    }

You will get all occurrences as value for any String

Upvotes: 0

Related Questions