import java.util.*;

public class SetExample {

    public static void main (String[] argv)
    {
	// Create an instance of the data structure.
	LinkedList<String> favoriteShows1 = new LinkedList<String>();

	// Put some elements in so that it becomes a set of strings.
	favoriteShows1.add ("Yes minister");
	favoriteShows1.add ("Seinfeld");
	favoriteShows1.add ("Cheers");
	favoriteShows1.add ("Frasier");
	favoriteShows1.add ("Simpsons");

	// Create a second instance and add some elements.
	LinkedList<String> favoriteShows2 = new LinkedList<String>();
	favoriteShows2.add ("Mad about you");
	favoriteShows2.add ("Seinfeld");
	favoriteShows2.add ("Frasier");
	favoriteShows2.add ("Cosby show");

	// Compute set intersection and the difference favoriteShows1-favoriteShows2
	computeIntersection (favoriteShows1, favoriteShows2);
	computeDifference (favoriteShows1, favoriteShows2);
    }


    static void computeIntersection (LinkedList<String> listA, LinkedList<String> listB)
    {
	System.out.println ("Intersection:");
	for (int i=0; i<listA.size(); i++) {
	    String s = listA.get(i);
	    // To be in the intersection, s needs to be in both sets.
	    if ( listB.contains(s) ) {
		System.out.println ("  " + s);
	    }
	}
    }


    static void computeDifference (LinkedList<String> listA, LinkedList<String> listB)
    {
	System.out.println ("Difference: ");
	for (int i=0; i<listA.size(); i++) {
	    String s = listA.get(i);
	    // If s is not in B, it's in the difference.
	    if ( ! listB.contains(s) ) {
		System.out.println ("  " + s);
	    }
	}
    }

}