1111.png
26d063757dce897be4a11427618b9ba.png
看到2018年刑偵科推理試題捍岳，一下子蒙住了，還有這種題睬隶？這么變態(tài)锣夹！但有過(guò)公務(wù)員考試經(jīng)歷的，一眼就能看出苏潜，這是標(biāo)準(zhǔn)的邏輯題晕城。
那咱就用程序來(lái)解決吧！
分析：
1.10道題窖贤，每道題答案是abcd中的一個(gè)砖顷，總共的情況也不過(guò)是4的10次方。我們把每一種情況都試一次赃梧，肯定能找到正確答案滤蝠。
2.10道題，每道題對(duì)應(yīng)數(shù)組的一個(gè)下標(biāo),那么就是一個(gè)長(zhǎng)度為10的數(shù)組授嘀，每一個(gè)數(shù)組就是一種情況物咳。
3.10道題的限制條件都通過(guò)的數(shù)組，就是我們需要的數(shù)組蹄皱。
附代碼：雖然代碼不是很優(yōu)秀涨薪，但至少解決了問(wèn)題悬赏，也是我個(gè)人心血的結(jié)晶赦抖。
運(yùn)行時(shí) 只需要調(diào)用#chooseArray()方法即可惧所。
public class MyTest {
private static final String TAG = "MTest";
String[] strs = {"A", "B", "C", "D"};
String[] aimArray = new String[10];
/**
* 根據(jù)i確定數(shù)組
*
* @param i
*/
public void getAimArray(int i, int j, int k, int l, int m, int n, int o, int p, int q, int r) {
aimArray[0] = strs[i];
aimArray[1] = strs[j];
aimArray[2] = strs[k];
aimArray[3] = strs[l];
aimArray[4] = strs[m];
aimArray[5] = strs[n];
aimArray[6] = strs[o];
aimArray[7] = strs[p];
aimArray[8] = strs[q];
aimArray[9] = strs[r];
}
public void chooseArray() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 4; k++) {
for (int l = 0; l < 4; l++) {
for (int m = 0; m < 4; m++) {
for (int n = 0; n < 4; n++) {
for (int o = 0; o < 4; o++) {
for (int p = 0; p < 4; p++) {
for (int q = 0; q < 4; q++) {
for (int r = 0; r < 4; r++) {
if (checkArray(i, j, k, l, m, n, o, p, q, r)) {
Log.e(TAG, "chooseArray: " + Arrays.toString(aimArray));
}
}
}
}
}
}
}
}
}
}
}
}
private boolean checkArray(int i, int j, int k, int l, int m, int n, int o, int p, int q, int r) {
getAimArray(i, j, k, l, m, n, o, p, q, r);
//條件判斷
//第3題判斷 存在且唯一 一道題的答案與其他三到題答案不同 且答案為第三題
if ((aimArray[2] != aimArray[5] && aimArray[2] != aimArray[1] && aimArray[2] != aimArray[3] && aimArray[2] == strs[0])
|| (aimArray[5] != aimArray[2] && aimArray[5] != aimArray[1] && aimArray[5] != aimArray[3] && aimArray[2] == strs[1])
|| (aimArray[1] != aimArray[2] && aimArray[1] != aimArray[5] && aimArray[1] != aimArray[3] && aimArray[2] == strs[2])
|| (aimArray[3] != aimArray[2] && aimArray[3] != aimArray[5] && aimArray[3] != aimArray[1] && aimArray[2] == strs[3])) {
//第4題判斷 存在且唯一 兩道題答案相同 且答案為第四題
if ((aimArray[0] == aimArray[4] && aimArray[1] != aimArray[6] && aimArray[0] != aimArray[8] && aimArray[5] != aimArray[9] && aimArray[3] == strs[0])
|| (aimArray[0] != aimArray[4] && aimArray[1] == aimArray[6] && aimArray[0] != aimArray[8] && aimArray[5] != aimArray[9] && aimArray[3] == strs[1])
|| (aimArray[0] != aimArray[4] && aimArray[1] != aimArray[6] && aimArray[0] == aimArray[8] && aimArray[5] != aimArray[9] && aimArray[3] == strs[2])
|| (aimArray[0] != aimArray[4] && aimArray[1] != aimArray[6] && aimArray[0] != aimArray[8] && aimArray[5] == aimArray[9] && aimArray[3] == strs[3])) {
//第5題判斷 存在且唯一 哪一題答案與第五題相同 且為第五題答案
if (aimArray[4] == aimArray[7] && aimArray[4] != aimArray[3] && aimArray[4] != aimArray[8] && aimArray[4] != aimArray[6]
|| aimArray[4] != aimArray[7] && aimArray[4] == aimArray[3] && aimArray[4] != aimArray[8] && aimArray[4] != aimArray[6]
|| aimArray[4] != aimArray[7] && aimArray[4] != aimArray[3] && aimArray[4] == aimArray[8] && aimArray[4] != aimArray[6]
|| aimArray[4] != aimArray[7] && aimArray[4] != aimArray[3] && aimArray[4] != aimArray[8] && aimArray[4] == aimArray[6]) {
//第6題判斷 存在且唯一 第哪兩題答案與第八題相同 且答案為第六題
if ((aimArray[7] == aimArray[1] && aimArray[7] == aimArray[3]
&& (aimArray[7] != aimArray[0] || aimArray[7] != aimArray[5])
&& (aimArray[7] != aimArray[2] || aimArray[7] != aimArray[9])
&& (aimArray[7] != aimArray[4] || aimArray[7] != aimArray[8])
&& aimArray[5] == strs[0])
|| (aimArray[7] == aimArray[0] && aimArray[7] == aimArray[5]
&& (aimArray[7] != aimArray[1] || aimArray[7] != aimArray[3])
&& (aimArray[7] != aimArray[2] || aimArray[7] != aimArray[9])
&& (aimArray[7] != aimArray[4] || aimArray[7] != aimArray[8])
&& aimArray[5] == strs[1])
|| (aimArray[7] == aimArray[2] && aimArray[7] == aimArray[9]
&& (aimArray[7] != aimArray[1] || aimArray[7] != aimArray[3])
&& (aimArray[7] != aimArray[0] || aimArray[7] != aimArray[5])
&& (aimArray[7] != aimArray[4] || aimArray[7] != aimArray[8])
&& aimArray[5] == strs[2])
|| (aimArray[7] == aimArray[4] && aimArray[7] == aimArray[8]
&& (aimArray[7] != aimArray[1] || aimArray[7] != aimArray[3])
&& (aimArray[7] != aimArray[0] || aimArray[7] != aimArray[5])
&& (aimArray[7] != aimArray[2] || aimArray[7] != aimArray[9])
&& aimArray[5] == strs[3])) {
//第7題 選中次數(shù)最少的字母
if (aimArray[6] == less()) {
//第10題 abcd 出現(xiàn)最多與最少的差
if (aimArray[9] == more()) {
//第9題 真假性相反
if ((aimArray[0] == aimArray[5] && (
(aimArray[5] != aimArray[4] && aimArray[9] == aimArray[4] && aimArray[1] == aimArray[4] && aimArray[8] == aimArray[4] && aimArray[8] == strs[0])
|| (aimArray[9] != aimArray[4] && aimArray[5] == aimArray[4] && aimArray[1] == aimArray[4] && aimArray[8] == aimArray[4] && aimArray[8] == strs[1])
|| (aimArray[1] != aimArray[4] && aimArray[9] == aimArray[4] && aimArray[5] == aimArray[4] && aimArray[8] == aimArray[4] && aimArray[8] == strs[2])
|| (aimArray[8] != aimArray[4] && aimArray[9] == aimArray[4] && aimArray[1] == aimArray[4] && aimArray[5] == aimArray[4] && aimArray[8] == strs[3])
))
|| (aimArray[0] != aimArray[5] && ((
(aimArray[5] == aimArray[4] && aimArray[9] != aimArray[4] && aimArray[1] != aimArray[4] && aimArray[8] != aimArray[4] && aimArray[8] == strs[0])
|| (aimArray[9] == aimArray[4] && aimArray[5] != aimArray[4] && aimArray[1] != aimArray[4] && aimArray[8] != aimArray[4] && aimArray[8] == strs[1])
|| (aimArray[1] == aimArray[4] && aimArray[9] != aimArray[4] && aimArray[5] != aimArray[4] && aimArray[8] != aimArray[4] && aimArray[8] == strs[2])
|| (aimArray[8] == aimArray[4] && aimArray[9] != aimArray[4] && aimArray[1] != aimArray[4] && aimArray[5] != aimArray[4] && aimArray[8] == strs[3])
)))) {
//第2題 第五題答案 第二題答案
if ((aimArray[4] == strs[2] && aimArray[1] == strs[0])
|| (aimArray[4] == strs[3] && aimArray[1] == strs[1])
|| (aimArray[4] == strs[0] && aimArray[1] == strs[2])
|| (aimArray[4] == strs[1] && aimArray[1] == strs[3])) {
return true;
} else {
return false;
}
} else {
return false;
}
} else {
return false;
}
} else {
return false;
}
} else {
return false;
}
} else {
return false;
}
} else {
return false;
}
} else {
return false;
}
}
private String less() {
int a = 0;
int b = 0;
int c = 0;
int d = 0;
for (int i = 0; i < 10; i++) {
if (aimArray[i] == strs[0]) {
a++;
}
if (aimArray[i] == strs[1]) {
b++;
}
if (aimArray[i] == strs[2]) {
c++;
}
if (aimArray[i] == strs[3]) {
d++;
}
}
if (a < b && a < c && a < d) {
return strs[2];
} else if (b < a && b < c && b < d) {
return strs[1];
} else if (c < a && c < b && c < d) {
return strs[0];
} else if (d < a && d < b && d < c) {
return strs[3];
} else {
return strs[0];
}
}
private String more() {
int a = 0;
int b = 0;
int c = 0;
int d = 0;
for (int i = 0; i < 10; i++) {
if (aimArray[i] == strs[0]) {
a++;
}
if (aimArray[i] == strs[1]) {
b++;
}
if (aimArray[i] == strs[2]) {
c++;
}
if (aimArray[i] == strs[3]) {
d++;
}
}
int max = Math.max(a, b);
max = Math.max(max, c);
max = Math.max(max, d);
int min = Math.min(a, b);
min = Math.min(min, c);
min = Math.min(min, d);
int distence = max - min;
if (distence == 3) {
return strs[0];
} else if (distence == 2) {
return strs[1];
} else if (distence == 4) {
return strs[2];
} else if (distence == 1) {
return strs[3];
} else {
return "F";
}
}
}
