关于吸血鬼数字的获取

吸血鬼数字时指位数为偶数的苏子，可以由一堆数字相乘而得到， 而这对数组各包含乘积一半位数的数字，对于找4位数的所有吸血鬼数字，产出了一些问题。

原先我用了最笨的方法实现：

public static void main(String[] args) throws IOException {
	long time = System.currentTimeMillis();
	
	for (int i = 1001; i < 9999; i++) {
		if (i % 100 == 0) {
			continue;
		}
		
		int a = i / 1000;
		int b = (i % 1000) / 100;
		int c = (i % 100) / 10;
		int d = i % 10;
		
		if (print(a, b, c, d, i))
			continue;
		if (print(a, b, d, c, i))
			continue;
		if (print(b, a, c, d, i))
			continue;
		if (print(b, a, d, c, i))
			continue;

		if (print(a, c, b, d, i))
			continue;
		if (print(a, c, d, b, i))
			continue;
		if (print(c, a, b, d, i))
			continue;
		if (print(c, a, d, b, i))
			continue;

		if (print(a, d, b, c, i))
			continue;
		if (print(a, d, c, b, i))
			continue;
		if (print(d, a, b, c, i))
			continue;
		if (print(d, a, c, b, i))
			continue;
	}
	
	System.out.println(System.currentTimeMillis() - time);
}

public static boolean print(int a, int b, int c, int d, int result) {
	int x = a * 10 + b;
	int y = c * 10 + d;

	if (result == x * y) {
		System.out.println(result + " = " + x + " * " + y);
		return true;
	} else {
		return false;
	}
}

时间只花了十几毫秒，但是心里总觉得算法不好，于是上网看了一下:

long time = System.currentTimeMillis();
for (int i = 10; i < 100; i++) {
	for (int j = i; j < 100; j++) {
		int result = i * j;

		if (result < 1000 || result > 9999 || result % 100 == 0 || (result - i - j) % 9 != 0) {
			continue;
		}

		char[] a = String.valueOf(result).toCharArray();
		char[] b = String.format("%d%d", i, j).toCharArray();
		Arrays.sort(a);
		Arrays.sort(b);

		if (Arrays.equals(a, b)) {
			System.out.println(String.format("%d = %d * %d", result, i, j));
		}

	}
}

System.out.println(System.currentTimeMillis() - time);

看起来很好，但是花费的时间却是前面那个方法的2倍，我猜是用创建对象和排序花了时间。

后来看到网友说的官方答案：

int[] startDigit = new int[4];
int[] productDigit = new int[4];
int count = 0;
long time = System.currentTimeMillis();

for (int num1 = 10; num1 <= 99; num1++)
	for (int num2 = num1; num2 <= 99; num2++) {
		int product = num1 * num2;
		startDigit[0] = num1 / 10;
		startDigit[1] = num1 % 10;
		startDigit[2] = num2 / 10;
		startDigit[3] = num2 % 10;
		productDigit[0] = product / 1000;
		productDigit[1] = (product % 1000) / 100;
		productDigit[2] = product % 1000 % 100 / 10;
		productDigit[3] = product % 1000 % 100 % 10;
		count = 0;
		for (int x = 0; x < 4; x++)
			for (int y = 0; y < 4; y++) {
				if (productDigit[x] == startDigit[y]) {
					count++;
					productDigit[x] = -1;
					startDigit[y] = -2;
					if (count == 4) {
						System.out.println(product + " = " + num1 + " * " + num2);
					}
				}
			}
	}
System.out.println(System.currentTimeMillis()-time);

只花了不到10毫秒的时间。

最后在官方答案中加上：

if (product < 1000 || product > 9999 || product % 100 == 0 || (product - num1 - num2) % 9 != 0) {
	continue;
}

终于，达到了神速1毫秒。