Java tutorial
//package com.java2s; /* * Copyright (C) 2000 - 2013 Silverpeas * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU Affero General Public License as * published by the Free Software Foundation, either version 3 of the * License, or (at your option) any later version. * * As a special exception to the terms and conditions of version 3.0 of * the GPL, you may redistribute this Program in connection with Free/Libre * Open Source Software ("FLOSS") applications as described in Silverpeas's * FLOSS exception. You should have recieved a copy of the text describing * the FLOSS exception, and it is also available here: * "http://www.silverpeas.org/docs/core/legal/floss_exception.html" * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Affero General Public License for more details. * * You should have received a copy of the GNU Affero General Public License * along with this program. If not, see <http://www.gnu.org/licenses/>. */ import java.util.*; public class Main { /** * Makes an intersection betwwen both of the given lists.<br/> * The result contains unique values. * @param list1 the first list. * @param list2 the second list. * @param <T> * @return the intersection between the two lists. */ public static <T> List<T> intersection(List<T> list1, List<T> list2) { List<T> list = new ArrayList<T>(new LinkedHashSet<T>(list1)); Iterator<T> iterator = list.iterator(); while (iterator.hasNext()) { if (!list2.contains(iterator.next())) { iterator.remove(); } } return list; } }