仅用位运算实现加减乘除

import java.util.Arrays;

public class 位运算 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		System.out.println(add(12, 15));
		System.out.println(subs(12, 15));
		System.out.println(mult(14, 5));
		System.out.println(Arrays.toString(divi(14, 3)));
		System.out.println(Arrays.toString(divi(14, -3)));
		System.out.println(Arrays.toString(divi(-14, 3)));
		System.out.println(Arrays.toString(divi(-14, -3)));

	}

	// 实现加法
	public static int add(int a, int b) {
		int m = a ^ b;// 不看进位的和
		int n = (a & b) << 1;// 只看进位
		while (n != 0) {// 若进位不为0则，则将以上两项相加
			int t = m ^ n;
			n = (m & n) << 1;
			m = t;
		}
		return m;
	}

	public static int subs(int a, int b) {
		int d = add(~b, 1);// 计算b的补码：d
		return add(a, d);// a-b= a+(b的补码)
	}

	public static int mult(int a, int b) {
		int result = 0;
		int m1 = a > 0 ? a : add(~a, 1);
		int m2 = b > 0 ? b : add(~b, 1);
		while (m2 > 0) {
			if ((m2 & 1) == 1) {
				result = add(result, m1);
			}
			m1 <<= 1;
			m2 >>= 1;
		}
		if ((a ^ b) < 0) {
			result = add(~result, 1);
		}
		return result;
	}

	public static int[] divi(int a, int b) {
		int[] result = new int[2];
		int m1 = a > 0 ? a : add(~a, 1);
		int m2 = b > 0 ? b : add(~b, 1);
		for (int i = 31; i >= 0; i = subs(i, 1)) {
			if ((m1 >> i) >= m2) {//看看够不够除数的2^i倍
				result[0] = add(result[0], 1 << i);
				m1 = subs(m1, m2 << i);
			}
		}
		if ((a ^ b) < 0) {
			result[0] = add(~result[0], 1);
		}
		result[1] = a > 0 ? m1 : add(~m1, 1);
		return result;
	}

	public static int pow(int a, int p) {
		int result = 0;

		return result;
	}

}