题解 | #懂二进制#
懂二进制
https://www.nowcoder.com/practice/120e406db3fd46f09d55d59093f13dd8
import java.util.*;
public class Solution {
public int countBitDiff (int m, int n) {
//将两数的异或值转换为二进制存入字符串
String x = Integer.toBinaryString(m^n);
//计算1的个数
int count = 0;
for(int i=0;i<x.length();i++){
if(x.charAt(i)=='1'){
count++;
}
}
return count;
}
}
public class Solution {
public int countBitDiff (int m, int n) {
//将两数的异或值转换为二进制存入字符串
String x = Integer.toBinaryString(m^n);
//计算1的个数
int count = 0;
for(int i=0;i<x.length();i++){
if(x.charAt(i)=='1'){
count++;
}
}
return count;
}
}