leetcode476: Number Complement

Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.

Note:

1. The given integer is guaranteed to fit within the range of a 32-bit signed integer.
2. You could assume no leading zero bit in the integer’s binary representation.

注意：说明了是32bit的整型变量。可以直接暴力求解，应该还有更好的方法

	public int findComplement(int num) {
		int flag = 31;
		int result = 0;
		int re[] = new int[32];
		for (int i = 0; i < 32; i++) {
			re[i] = num % 2;
			num = num / 2;
		}
		while (re[flag--] == 0)
			;
		for (++flag; flag >= 0; flag--)
			if (re[flag] == 0)
				re[flag] = 1;
			else
				re[flag] = 0;
		for (int j = 0; j < 32; j++)
			result += re[j] * (int) Math.pow(2, j);
		return result;
	}