I have two lists which both have integers added into. I want to intersect the two lists and union. I have my code, but for some reason it won't compile.
Any suggestions as to why I can't simply LinkedList.intersection(argument, argument)
?
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Set;
public class IntegerSet
{
public static void main(String args[]) {
LinkedList<Double> list1 = new LinkedList<Double>();
list1.add((double) 5);
list1.add((double) 15);
list1.add((double) 3);
list1.add((double) 15);
LinkedList<Double> list2 = new LinkedList<Double>();
list2.add((double) 15);
list2.add((double) 8);
list2.add((double) 16);
list2.add((double) 11);
// Calculating Intersection of two Set in Java
LinkedList<Double> intersection = LinkedList.intersection(list1, list2);
System.out.printf("Intersection of two Set %s and %s in Java is %s %n",
list1.toString(), list2.toString(), intersection.toString());
System.err.println("Number of elements common in two Set : "
+ intersection.size());
// Calculating Union of two Set in Java
LinkedList<Double> union = LinkedList.union(list1, list2);
System.out.printf("Union of two Set %s and %s in Java is %s %n",
list1.toString(), list2.toString(), union.toString());
System.out.println("total number of element in union of two Set is : "
+ union.size());
}
}