问一个简单的算法有关问题
日期：2014-05-20 浏览次数：20741 次
问一个简单的算法问题
有这么两个字符串数组
String strA = {"h","k","i", "e"}
String strB = {"a","b","c","d","e","f","g","h","i","j","k"}
现在我要找出strA和strB的交集并输出，请问要怎么做？
如果按照这种方法效率肯定不高，要怎样改进？
------解决方案--------------------
用集合吧
有这么两个字符串数组
String strA = {"h","k","i", "e"}
String strB = {"a","b","c","d","e","f","g","h","i","j","k"}
现在我要找出strA和strB的交集并输出，请问要怎么做？
如果按照这种方法效率肯定不高，要怎样改进？
- Java code
for(String str1 : strA)
{
for(String str2 : strB)
{
if(str1.equals(str2))
....
}
}
------解决方案--------------------
用集合吧
- Java code
String[] strA = {"h","k","i", "e"};
String[] strB = {"a","b","c","d","e","f","g","h","i","j","k"};
List<String> l1 = new ArrayList<String>(Arrays.asLit(strA));
List<String> l2 = new ArrayList<String>(Arrays.asLit(strB));
l1.retainAll(l2); //交集 l1.removeAll(l2)差集 l1.addAll(l2)并集
String[] sab = l1.toArray(new String[0]);
for (String s : sab) {
System.out.println(s);
}
免责声明： 本文仅代表作者个人观点，与爱易网无关。其原创性以及文中陈述文字和内容未经本站证实，对本文以及其中全部或者部分内容、文字的真实性、完整性、及时性本站不作任何保证或承诺，请读者仅作参考，并请自行核实相关内容。
