Java爬坑 -- 判断两个数组是否存在相同元素 (内牛满面)

问题:判断两个数组是否存在相同元素

今天做一个数组添加操作,,但是要判断数据是否重复,,,头脑第一个想法就是遍历两个数组查询是否有重复,

然后就吧啦吧啦.....一通狂敲,如下:

       boolean has = false;
       String[] strOne= {"c","b","a","d"};
       String[] strTwo= {"a","b","d","g"};
       for (int i = 0; i < strOne.length; i++) {
           if (ArrayUtils.contains(strTwo, strOne[i])) {
               has = true;
               break;
            }
        }

        System.out.println(has )
   
           

写完之后莫名的不爽,我要到循环里面进行判断..........

然后在分析问题 ,判断两个数组是否存在相同元素 .........咦------倒吸一口冷气,这丫的不就是求交集么

交集的函数不就是retainAll

然后马上开始吧啦吧啦.......一通狂敲,如下:

    boolean has = false;
    String[] strOne= {"c","b","a","d"};
    String[] strTwo= {"a","b","d","g"};
    HashSet<String> set = new HashSet<>(Arrays.asList(strOne));
    set.retainAll(Arrays.asList(strTwo));
    if(set.size() > 0){
        has =  true;
    }

虽然一个九行一个八行 ,, 但是需要我们好好想一下,,,如果问题再复杂一下呢? 

一.条条大路通罗马,,,分析问题,,,找到最优

二.一些基础函数不用难免忘记