How to Perform Intersection and Union Operations on ArrayLists in Java?

Intersecting and Uniting ArrayLists in Java

Question:

How to perform intersection and union operations on ArrayLists in Java? Extension to the question is regarding the applicability of ArrayLists for file filtering in the context of set theory.

Answer:

ArrayLists offer no built-in methods for intersection or union. A straightforward implementation is provided below:

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class ArrayListOperations {

    public static void main(String[] args) {
        List<String> list1 = new ArrayList<>(Arrays.asList("A", "B", "C"));
        List<String> list2 = new ArrayList<>(Arrays.asList("B", "C", "D", "E", "F"));

        System.out.println(intersection(list1, list2));
        System.out.println(union(list1, list2));
    }

    public static <T> List<T> intersection(List<T> list1, List<T> list2) {
        List<T> list = new ArrayList<>();

        for (T t : list1) {
            if (list2.contains(t)) {
                list.add(t);
            }
        }

        return list;
    }

    public static <T> List<T> union(List<T> list1, List<T> list2) {
        Set<T> set = new HashSet<>();

        set.addAll(list1);
        set.addAll(list2);

        return new ArrayList<>(set);
    }
}

Regarding File Filtering:

Using ArrayLists for file filtering is appropriate if the number of files is relatively small. However, for larger datasets, considering a more efficient data structure like a HashSet or TreeSet would be beneficial for optimized runtime performance.

The above is the detailed content of How to Perform Intersection and Union Operations on ArrayLists in Java?. For more information, please follow other related articles on the PHP Chinese website!