5.5

Topic 5.5 Write a function to determine the number of bits required to convert interger A to interger B.

方法1XOR represents a bit that is different between A and B. Then shift the XOR result.

改进: To make it better, use c=c&(c-1) to clear the leaset significant bit.

public class c5_3 {
	public static int bitSwapRequired(int a, int b) {
		int count = 0;
		for (int c = a ^ b; c != 0; c = c >> 1) { 
			count += c & 1;
		}
		return count;
	}

	public static int bitSwapRequired2(int a, int b){
		int count = 0;
		for (int c = a ^ b; c != 0; c = c & (c-1)) {
			count++;
		}
		return count;
	}
	
	public static void main(String[] args) {
		int a=15;
		int b=16;
		System.out.println(a+":"+Integer.toBinaryString(a));
		System.out.println(b+":"+Integer.toBinaryString(b));
		System.out.println("Required number of bits: " + bitSwapRequired(a, b) + " " + bitSwapRequired2(a, b));
			
	}
	}
//结果
15:1111
16:10000
Required number of bits: 5 5



 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值