List去重几种方法总结

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

public class TestListArrayList {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
//		testList();
		List list = new ArrayList();
		list.add("a");
		list.add("b");
		list.add("c");
		list.add("a");
		list.add(1);
		list.add(2);
		list.add(3);
		list.add(1);
		list.add("b");

		List list2 = testList(list);
        for (int i = 0; i < list2.size(); i++) {
			System.out.println(list2.get(i).toString());
		}
	}

	/**
	 * set里元素不重复，用LinkedHashSet是保持原来顺序的
	 * @param list
	 * @return
	 */
	public static List testList(List list)
	{
		LinkedHashSet hs = new LinkedHashSet(list);
		List resultlist = new ArrayList();
		Iterator it = hs.iterator();
		while (it.hasNext())
		{
			resultlist.add(it.next().toString());
		}
		return resultlist;
	}

	/**
	 * 迭代方法
	 * @param list
	 * @return
	 */
	public static List testList2(List list) {
		List resultlist = new ArrayList();
		Iterator it = list.iterator();
		while (it.hasNext()) {
			Object itnext = it.next();
			if (resultlist.contains(itnext)) {
				it.remove();
			} else {
				resultlist.add(itnext);
			}
		}
		return list;
	}

	/**
	 * 赋值到另一个List
	 * @param list
	 * @return
	 */
	public static List testList3(List list) {
		List resultlist = new ArrayList();
		Iterator it = list.iterator();
		while (it.hasNext()) {
			Object itnext = it.next();
			if (resultlist.contains(itnext)) {
				it.remove();
			} else {
				resultlist.add(itnext);
			}
		}
		return resultlist;
	}
}