起因
最近离职了,可以一整天的在技术群里吹水了。
然后在群里看到有人拿题出来,就试着做了一下。
经过
我看到题的第一个想法是每个老鼠喝两桶找到重叠被毒死的老鼠例如第一只老鼠喝1,2第二只喝2,3。如果2有毒那么就是第二只被毒死。
然后我洗澡的时候突然想起之前看李永乐老师的一个视屏。多个集合中不同的数字。让学生随意想一个数。然后是否包含在集合中快速的得出结果。用了二进制来做。我思考了一下这个解决方案完美适用。
大致思路
被毒死的填1存活的为0。这样就可以得到被存在毒药序号的二进制数。然后转成10进制就可以得到。这种算法只需要和二进制长度相同的老鼠就可以找到那一桶为毒药。
1000的二进制数为1111101000 那么需要十只老鼠就可以找到那一桶存在毒药。
import java.util.ArrayList;
import java.util.List;
public class Demo01 {
// 定义出1000桶水
private static final List<Integer> ALL_LIST = new ArrayList<>(1000);
// 那一桶是有毒的,懒得写随机数了,这里随意指定一个
private static final int a = 677;
// 每一只老鼠各自需要试的水
private static final List<Integer> MOUSE_1 = new ArrayList<>();
private static final List<Integer> MOUSE_2 = new ArrayList<>();
private static final List<Integer> MOUSE_3 = new ArrayList<>();
private static final List<Integer> MOUSE_4 = new ArrayList<>();
private static final List<Integer> MOUSE_5 = new ArrayList<>();
private static final List<Integer> MOUSE_6 = new ArrayList<>();
private static final List<Integer> MOUSE_7 = new ArrayList<>();
private static final List<Integer> MOUSE_8 = new ArrayList<>();
private static final List<Integer> MOUSE_9 = new ArrayList<>();
private static final List<Integer> MOUSE_10 = new ArrayList<>();
// 定义位数,用于计算哪一位为 1
private static final int BINARY_1 = 1;
private static final int BINARY_2 = 1 << 1;
private static final int BINARY_3 = 1 << 2;
private static final int BINARY_4 = 1 << 3;
private static final int BINARY_5 = 1 << 4;
private static final int BINARY_6 = 1 << 5;
private static final int BINARY_7 = 1 << 6;
private static final int BINARY_8 = 1 << 7;
private static final int BINARY_9 = 1 << 8;
private static final int BINARY_10 = 1 << 9;
public static void main(String[] args) {
init();
show();
}
public static void show() {
StringBuilder sb = new StringBuilder();
sb.append(MOUSE_1.contains(a) ? "1" : "0");
sb.append(MOUSE_2.contains(a) ? "1" : "0");
sb.append(MOUSE_3.contains(a) ? "1" : "0");
sb.append(MOUSE_4.contains(a) ? "1" : "0");
sb.append(MOUSE_5.contains(a) ? "1" : "0");
sb.append(MOUSE_6.contains(a) ? "1" : "0");
sb.append(MOUSE_7.contains(a) ? "1" : "0");
sb.append(MOUSE_8.contains(a) ? "1" : "0");
sb.append(MOUSE_9.contains(a) ? "1" : "0");
sb.append(MOUSE_10.contains(a) ? "1" : "0");
System.out.println(sb.reverse());
}
// 初始化数组
public static void init() {
for (int i = 1; i < 1001; i++) {
ALL_LIST.add(i);
if ((i & BINARY_1) == BINARY_1) {
MOUSE_1.add(i);
}
if ((i & BINARY_2) == BINARY_2) {
MOUSE_2.add(i);
}
if ((i & BINARY_3) == BINARY_3) {
MOUSE_3.add(i);
}
if ((i & BINARY_4) == BINARY_4) {
MOUSE_4.add(i);
}
if ((i & BINARY_5) == BINARY_5) {
MOUSE_5.add(i);
}
if ((i & BINARY_6) == BINARY_6) {
MOUSE_6.add(i);
}
if ((i & BINARY_7) == BINARY_7) {
MOUSE_7.add(i);
}
if ((i & BINARY_8) == BINARY_8) {
MOUSE_8.add(i);
}
if ((i & BINARY_9) == BINARY_9) {
MOUSE_9.add(i);
}
if ((i & BINARY_10) == BINARY_10) {
MOUSE_10.add(i);
}
}
}
}
这样就可以实现10只老鼠找到一千桶水中那一桶水有毒。前提是老鼠不会被撑死。。。。