package LeetCode.OneThousandMore;
public class OneThousandAndNine {
public int bitwiseComplement(int N) {
String two = Integer.toBinaryString(N);
StringBuilder sb = new StringBuilder();
for (int i = 0; i < two.length(); i++){
char b = two.charAt(i);
if (b == '1')
sb.append(0);
else
sb.append(1);
}
return Integer.valueOf(sb.toString(),2);
}
}
LeetCode——1009.十进制整数的反码(Java)
最新推荐文章于 2023-01-12 20:41:29 发布