_3226.java

packagecom.fishercoder.solutions.fourththousand;

publicclass_3226 {
publicstaticclassSolution1 {
publicintminChanges(intn, intk) {
if (n == k) {
return0;
 }
StringnBin = Integer.toBinaryString(n);
StringkBin = Integer.toBinaryString(k);
if (nBin.length() > kBin.length()) {
StringBuildersb = newStringBuilder(kBin);
sb.reverse();
while (nBin.length() > sb.length()) {
sb.append("0");
 }
kBin = sb.reverse().toString();
 }
if (nBin.length() != kBin.length()) {
return -1;
 }
intminChanges = 0;
for (inti = nBin.length() - 1; i >= 0; i--) {
if (nBin.charAt(i) != kBin.charAt(i)) {
if (nBin.charAt(i) == '1') {
minChanges++;
 } else {
return -1;
 }
 }
 }
returnminChanges;
 }
 }
}