思路一

先找到最長的數(shù)組，然后循環(huán)短的數(shù)組并判斷元素是否在長數(shù)組中

public class Main {

public static void main(String[] args) throws CloneNotSupportedException {

String[] strArr1={"ee","aa","bb","cc"};

String[] strArr2={"aa","bb","cc","dd","44"};

System.out.println(Main.subContain(strArr1,strArr2));

}

public static boolean subContain(String[] strArr1, String[] strArr2) {

if (null == strArr1 || null == strArr2) {

return false;

}

boolean flag = true;

if (strArr2.length > strArr1.length) {

String[] temp;

temp = strArr1;

strArr1 = strArr2;

strArr2 = temp;

}

for (String str : strArr2) {

if (!Arrays.asList(strArr1).contains(str)) {

flag = false;

break;

}

}

return flag;

}

}

思路二

判斷兩個(gè)數(shù)組的交集長度是否等于最小的數(shù)組長度，用到了第三方的jar包

public class Main {

public static void main(String[] args) throws CloneNotSupportedException {

String[] strArr1 = {"aa", "bb", "cc"};

String[] strArr2 = {"aa", "bb", "cc", "dd", "44"};

System.out.println(Main.subContain(strArr1, strArr2));

}

public static boolean subContain(String[] strArr1, String[] strArr2) {

if (null == strArr1 || null == strArr2) {

return false;

}

Collection collection = org.apache.commons.collections.CollectionUtils.intersection(Arrays.asList(strArr1), Arrays.asList(strArr2));

return collection.size() == Math.min(strArr1.length, strArr2.length);

}

}

總結(jié)

以上是生活随笔為你收集整理的java两个长度不同数组_两组数组,长度不一样,如果其中一个数组的值在另一个中不存在,则不符合要求.怎么算?...的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。