有两个字符串数组a和b，寻找相同元素 (a和b都比较大),求效率最高的解答

呵呵，论坛有人在讨论下面题目的最后解法，本人综合了下大家的思路，欢迎大家指正

/*
 * 有两个字符串数组a和b，寻找相同元素 (a和b都比较大),求效率最高的解答
 */
public class compareArray {
    private Logger logger = Logger.getLogger(compareArray.class);

    // 基本思路：相同 = 集合2-（集合2-集合1中相同的=不相同的）
    @Test
    public void getSameElementByList() {
        Long begin=System.currentTimeMillis();
        String[] strArr1 = { "xiaoxin", "niutou", "shanqiu", "luobo" };
        String[] strArr2 = { "xiaoxin", "ggg", "shanqiu", "meile", "dddsf", "niutou" };
        List<String> coll = Arrays.asList(strArr1);
        List<String> coll2 = Arrays.asList(strArr2);
        List<String> alter0 = new ArrayList<String>(coll2);
        List<String> alter1 = new ArrayList<String>(coll);
        List<String> alter2 = new ArrayList<String>(coll2);
        alter2.removeAll(alter1);
        Iterator<String> it1 = alter2.iterator();
        while (it1.hasNext())
            logger.info(it1.next());
        logger.info("-------华丽的分割线-----------");
        alter0.removeAll(alter2);
        Iterator<String> it2 = alter0.iterator();
        while (it2.hasNext())
        {
            logger.info(it2.next());
        }
        Long end=System.currentTimeMillis();
        logger.info(end-begin);
    }
    /**
     * 把数组A的数据作为map的key，和value，然后用B的数据取值，不为NULL，说明相同
     */
    @Test
    public void getSameElementByMap(){
        Long begin=System.currentTimeMillis();
        logger.info("-------华丽的分割线-----------");
        String[] strArr1 = { "xiaoxin", "niutou", "shanqiu", "luobo" };
        String[] strArr2 = { "xiaoxin", "ggg", "shanqiu", "meile", "dddsf", "niutou" };
        HashMap<String,Object> map=new HashMap<String, Object>();
        for (String string1 : strArr1) {
            map.put(string1, string1);
        }
        for (String string2 : strArr2) {
            Object j=map.get(string2);
            if(j!=null){
                logger.info(j.toString());
            }
        }
        Long end=System.currentTimeMillis();
        logger.info(end-begin);
        
    }
}