LeetCode Solutions
991. Broken Calculator
Time: Space:
class Solution {
public:
int brokenCalc(int X, int Y) {
int ops = 0;
while (X < Y) {
if (Y % 2 == 0)
Y /= 2;
else
Y += 1;
++ops;
}
return ops + X - Y;
}
};
class Solution {
public int brokenCalc(int X, int Y) {
int ops = 0;
while (X < Y) {
if (Y % 2 == 0)
Y /= 2;
else
Y += 1;
++ops;
}
return ops + X - Y;
}
}
class Solution:
def brokenCalc(self, X: int, Y: int) -> int:
ops = 0
while X < Y:
if Y % 2 == 0:
Y //= 2
else:
Y += 1
ops += 1
return ops + X - Y