算法运算符二

|（按位或）

|按位或和&按位与计算方式都是转换二进制再计算，不同的是运算规则(一个为真即为真) 1|0 = 1 , 1|1 = 1 , 0|0 = 0 , 0|1 = 1
下面是我自己算的

private static void demo9() {
//|按位或和&按位与计算方式都是转换二进制再计算，不同的是运算规则(一个为真即为真)
// 1|0 = 1 , 1|1 = 1 , 0|0 = 0 , 0|1 = 1
int j =5|7; //7
//5: 0101;
//7: 0111;
//0111 结果为7;
int z=-5|7;
//-5:1000,0000,0000,0000,0000,0101;
//取反
//1111,1111,1111,1111,1111,1111,1010
//加一
//1111,1111,1111,1111,1111,1111,1011
//7:0000,0000,0000,0000,0000,0000,0111;
//1111,1111,1111,1111,1111,1111,1111
//取反
//1000,0000,0000,0000,0000,0000,0000;
//加一
//1000,0000,0000,0000,0000,0000,0001;
//结果为-1;
int a=5|-7;
//-7: 1000,0000,0000,0000,0000,0000,0111;
//取反
//1111,1111,1111,1111,1111,1111,1111,1000;
//加一
//1111,1111,1111,1111,1111,1111,1111,1001;
//5:0000,0000,0000,0000,0000,0000,0000,0101;
//1111,1111,1111,1111,1111,1111,1111,1101;
//取反
//1000,0000,0000,0000,0000,0000,0000,0010
//加一
//1000,0000,0000,0000,0000,0000,0000,0011
//结果为-3;
int b =-5|-7;
//-5:1000,0000,0000,0000,0000,0101;
//取反
//1111,1111,1111,1111,1111,1111,1010
//加一
//1111,1111,1111,1111,1111,1111,1011
//-7: 1000,0000,0000,0000,0000,0000,0111;
//取反
//1111,1111,1111,1111,1111,1111,1111,1000;
//加一
//1111,1111,1111,1111,1111,1111,1111,1001;
//1111,1111,1111,1111,1111,1111,1111,1011
//1111,1111,1111,1111,1111,1111,1111,1011;
//取反
//1000,0000,0000,0000,0000,0000,0000,0100;
//加一
//1000,0000,0000,0000,0000,0000,0000,0101;
//结果为-5;
System.out.println(“j:”+j+“z:”+z+“a:”+a+“b:”+b);
}

&(按位与)

&按位与的运算规则是将两边的数转换为二进制位，然后运算最终值，运算规则即(两个为真才为真)1&1=1 , 1&0=0 , 0&1=0 , 0&0=0

/**
* &(按位与)
*/
public static void demo8(){
int i = 3&5;
//&按位与的运算规则是将两边的数转换为二进制位，然后运算最终值，运算规则即(两个为真才为真)
// 1&1=1 , 1&0=0 , 0&1=0 , 0&0=0
//3:0011
//5:0101;
//得:0001; 结果为1;
int j= 5&7;
//5:0101;
//7:0111
//0101 结果为5;
int z = -5&7;
//-5:1000,0000,0000,0000,0000,0101;
//取反
//1111,1111,1111,1111,1111,1111,1010
//加一
//1111,1111,1111,1111,1111,1111,1011
//7:0000,0000,0000,0000,0000,0000,0111,
//0000,0000,0000,0000,0000,0000,0011;
//结果为3;
int a = 5&-7;
//-7: 1000,0000,0000,0000,0000,0000,0111;
//取反
//1111,1111,1111,1111,1111,1111,1111,1000;
//加一
//1111,1111,1111,1111,1111,1111,1111,1001;
//5:0000,0000,0000,0000,0000,0000,0000,0101;
//0000,0000,00000,0000,0000,0000,0000,0001;
//结果为 1;
int b = -5&-7;
//-5:1000,0000,0000,0000,0000,0101;
//取反
//1111,1111,1111,1111,1111,1111,1010
//加一
//1111,1111,1111,1111,1111,1111,1011
//-7: 1000,0000,0000,0000,0000,0000,0111;
//取反
//1111,1111,1111,1111,1111,1111,1111,1000;
//加一
//1111,1111,1111,1111,1111,1111,1111,1001;
//1111,1111,1111,1111,1111,1111,1111,1011
//1111,1111,1111,1111,1111,1111,1111,1001
//取反
//1000,0000,0000,0000,0000,0000,0000,0110
//加一
//1000,0000,0000,0000,0000,0000,0000,0111
//结果为-7
System.out.println(“i:”+i);//1
System.out.println(“j:”+j);//5
System.out.println(“z:”+z);//3
System.out.println(“a:”+a);//1
System.out.println(“b:”+b);//-7
}

可以进我的博客先看一再看二好一点