Java位运算

（很早的笔记，保存下）

• 与
• 或
• 非

整数位运算：

• 左移：正数右端补0，负数右端补1
• 右移：正数左端补0，负数左端补1
• 强制右移：不论正负数左端补0
• 取反

int a = 5;
int b = -5;
int c = (~5)+1;
int d = a<<1;
int e = b<<1;
int f = a>>1;
int g = b>>1;
int h = a>>>1;
int i = b>>>1;

System.out.println("a:"+Integer.toBinaryString(a));
System.out.println("b:"+Integer.toBinaryString(b));
System.out.println("c:"+Integer.toBinaryString(c));
System.out.println("d:"+Integer.toBinaryString(d));
System.out.println("e:"+Integer.toBinaryString(e));
System.out.println("f:"+Integer.toBinaryString(f));
System.out.println("g:"+Integer.toBinaryString(g));
System.out.println("h:"+Integer.toBinaryString(h));
System.out.println("i:"+Integer.toBinaryString(i));
//-------结果------------------------
a:101
b:11111111111111111111111111111011
c:11111111111111111111111111111011
d:1010
e:11111111111111111111111111110110
f:10
g:11111111111111111111111111111101
h:10
i:1111111111111111111111111111101			//注意这里少一位

Java位运算

原文：https://www.cnblogs.com/cdbb/p/12558204.html