位运算实现加减乘除

//priny binary  用来在实现过程中打印二进制和数字来看变化
public static void print(int num) {
   for (int i = 31; i >= 0; i--) {
      System.out.print((num & (1 << i))>>i);
   }
   System.out.println("\n"+num);
}

//利用异或实现无进位相加，与实现进位信息的保存，之后通过while循环迭代相加
public static int add(int a, int b) {
   int sum = a;
   while (b != 0) {
      sum = a ^ b;   //无进位相加
      b = (a & b) << 1;  //进位的数字
      a = sum;      //a重新赋值重新加
      System.out.print("a:");
      print(a);
      System.out.print("b:");
      print(b);
   }
   return sum;
}

a:00000000000000000000000000010101
21
b:00000000000000000000000000010000
16
a:00000000000000000000000000000101
5
b:00000000000000000000000000100000
32
a:00000000000000000000000000100101
37
b:00000000000000000000000000000000
0

   public static int negNum(int n) {
      return add(~n, 1);
   }

   public static int minus(int a, int b) {
      return add(a, negNum(b));
   }

   public static int multi(int a, int b) {
      int res = 0;
      while (b != 0) {
         if ((b & 1) != 0) {
            res = add(res, a);
         }
         a <<= 1;
         b >>>= 1;
      }
      return res;
   }

   public static boolean isNeg(int n) {
      return n < 0;
   }

   public static int div(int a, int b) {
      int x = isNeg(a) ? negNum(a) : a;
      int y = isNeg(b) ? negNum(b) : b;
      int res = 0;
      for (int i = 30; i >= 0; i = minus(i, 1)) {
         if ((x >> i) >= y) {
            res |= (1 << i);
            x = minus(x, y << i);
         }
      }
      return isNeg(a) ^ isNeg(b) ? negNum(res) : res;
   }

   public static int divide(int a, int b) {
      if (a == Integer.MIN_VALUE && b == Integer.MIN_VALUE) {
         return 1;
      } else if (b == Integer.MIN_VALUE) {
         return 0;
      } else if (a == Integer.MIN_VALUE) {
         if (b == negNum(1)) {
            return Integer.MAX_VALUE;
         } else {
            int c = div(add(a, 1), b);
            return add(c, div(minus(a, multi(c, b)), b));
         }
      } else {
         return div(a, b);
      }
   }