Question

I have a list of objects like this:

ArrayList<Phone> list = new ArrayList();
list.add(new Phone("[phone]", "mobile", "26"));
list.add(new Phone("[phone]", "home", "23"));
list.add(new Phone("[phone]", "mobile", "27"));
list.add(new Phone("[phone]", "work", "26"));
list.add(new Phone("[phone]", "home", "27"));
list.add(new Phone("[phone]", "home", "26"));

(23, 26, 27 being id’s of the contact). How can I “query” this list to get ids of the contacts that have more than one telephone number {"26", "27"}?

I need the optimal solution that doesn’t store many small objects to memory (my poor implementation causes GC to run frequently, freezing the phone for a long periods of time).

Answer 1

Can you use this algorithm?

Set<String> dupIds = new HashSet<String>();
Set<String> set = new HashSet<String>();

for (Phone p: list) {
  if (set.contains(p.id)) {
     dupIds.add(p.id);
  } else {
     set.add(p.id);
  }
}

dupIds contains duplicate ids at the end of the process and I don’t see too many small object being created here.