Rotate bits of a number 左旋转或右旋转一个数 @GFG.pdfVIP

RRoo aa ee bbii ss ooff aa nnuummbbeerr 左左旋旋转转或或右右旋旋转转一一个个数数 @@GGFFGG Bit Rotat ion: A rotat ion (or c irc ular shift) is an operat ion similar to shift except t hat t he bits t hat fall off at one end are put bac k to t he ot her end. In left rotat ion, t he bits t hat fall off at left end are put bac k at right end. In right rotat ion, t he bits t hat fall off at right end are put bac k at left end. Example : et n is stored using 8 bits. eft rotat ion of n = by 3 makes n = ( eft shifted by 3 and first 3 bits are put bac k in last ). If n is stored using 16 bits or 32 bits t hen left rotat ion of n (000 becomes 00..0011100101000. Right rotat ion of n = by 3 makes n = (Right shifted by 3 and last 3 bits are put bac k in first ) if n is stored using 8 bits. If n is stored using 16 bits or 32 bits t hen right rotat ion of n (000 by 3 becomes 101000..0011100. /** * * 左旋转：shift掉左边的bits，补到右边 右旋转：shift掉右边的bits，补到左边 例如： 1110 0101 左旋转3个数变成 0010 1111 1110 0101 右旋转3个数变成 1011 1100 * */ public class RotateBitsOfANumber { public static void main ( tring [] args) { int n = 0xE5; // 1110 0101 int d = 3; int int_bits = 8; ystem .out.println (Integer.toBinary tring (leftRotate (n, d, int_bits)));//0010 1 ystem .out.println (Integer.toBinary tring (rightRotate (n, d, int_bits))); } // 最后一个是用来保持int_bits位数 public static int leftRotate (int n, int d, int int_bits){ return ((nd) | (n (int_bits-d))) ((1int_bits)-1); } public static int rightRotate (int n, int d, int int_bits){ return ((nd) | (n (int_bits-