我期待在Java中創建一個函數,它將採用兩個數組或列表,並能夠判斷第一個數組(第一個數組)是否適合第二個數組(目標)。目標數組的值不能超過源數組中的值。一個數組中的所有數字都是<=到另一個數組
例如:
[ 16, 16, 16 ] will not fit into [ 13, 13, 22 ]
[ 12, 12 ] will fit into [ 16, 16, 12 ]
[ 12, 18, 14 ] will not fit into [ 10, 18, 14 ]
[ 12, 24 ] will fit into [ 10, 12, 24 ]
[ 10, 10, 10 ] will not fit into [ 10, 10 ]
我目前的嘗試(IANA CS專業!)是確定爲3元的陣列,而這一切我需要擔心在短期內,但我錯過了一些內部循環中的邏輯將防止漏報。
要點:https://gist.github.com/1208514
private Boolean designFits(int[] max, int[] design) {
Boolean designFits = true;
Arrays.sort(max);
Arrays.sort(design);
int passCount = 0;
if(design.length <= max.length) {
for(int i = 0; i < max.length; i++) {
for(int j = 0; j < design.length; j++) {
if(max[i] <= design[j]) {
passCount++;
}
}
}
if(passCount == 0 || passCount > max.length) {
designFits = false;
}
} else {
designFits = false;
}
return designFits;
}
什麼是 「合適」 呢? LHS中的元素是否需要存在於RHS中?如果是的話,這是否意味着LHS必須是RHS的子集? –