7

Java中有一个内置函数可以用来交换两位吗?

例如:

_ _ _ _ 1 _ _ 0 位 3 与位 0 交换并变为 _ _ _ _ 0 _ _ 1

我知道它可以使用一个长的按位操作过程来完成,但我想避免这样做。

4

3 回答 3

12

你也可以试试这个方法

//positions are indexed from 0 and in order ...[4][3][2][1][0]
//so changing 3 and 1 will make             ...[4][1][2][3][0]
public static int swap(int i, int pos1, int pos2) {

    int bit1 = (i >> pos1) & 1;// bit at pos1
    int bit2 = (i >> pos2) & 1;// bit at pos2

    if (bit1 == bit2)
        return i; // no need to swap since we change 1 with 1 or 0 with 0

    // Since we are here it means that we need to change 1->0 and 0->1.
    // To do this we can use XOR (^).
    // Lets create mask 000001010 with ones at specified positions
    int mask = (1 << pos1) | (1 << pos2);

    return i ^ mask;// TADAM!!!
}
于 2013-04-10T15:26:37.007 回答
7

这是另一种方式,称为增量交换。

int t = (i ^ (i >> 3)) & 1;
return i ^ t ^ (t << 3);

或更一般地说:

static int swap(int x, int i, int j)
{
    // precondition: i > j
    int d = i - j;
    int y = (x ^ (x >> d)) & (1 << j);
    return x ^ y ^ (y << d);
}
于 2013-04-10T14:44:19.597 回答
5

我正在详细制作,但您可以将其加入单行

 int temp1 = (i & 0x1) << 3; //extract lowest bit #1 and place at pos# 4
 int temp2 = (i & 0x8) >> 3; //extract bit #4 and place at pos #1
 i = (i & temp1) | (i & ~temp1); //now pos #4 is ready     
 i = (i & temp2) | (i & ~temp2); //now pos #1 is ready
于 2013-04-10T14:37:45.900 回答