1. 在java中怎麼判斷一個數組包含另一個數組
雙循環,把數組中的每一個值都拿來做比較、判斷!!1
public static boolean containArray(int[] a, int[] b) {
boolean flag = false;
int k = 0;
/**
* 統計b中包含a中的元素是否與a的元素個數相同
*/
if (a.length < b.length) {
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < b.length; j++) {
if (a[i] == b[j]) {
k++;
System.out.println(a[i] +"/"+ b[j]);
continue;
}
}
}
}
if (k == a.length) flag = true;
return flag;
}
2. java 怎麼將一個數組拆分成兩個數組
importjava.util.Arrays;
publicclassTest{
publicstaticvoidmain(String[]args){
String[]str={"112","2321","3231","4443","5321"};
String[]sub1=Arrays.Of(str,3);
String[]sub2=Arrays.OfRange(str,3,str.length);
System.out.println(Arrays.deepToString(sub1));
System.out.println(Arrays.deepToString(sub2));
}
}
運行結果