Given a positive integer n, you can apply one of the following operations:
n is even, replace n with n / 2.n is odd, replace n with either n + 1 or n - 1.Return the minimum number of operations needed for n to become 1.
Example 1:
Input: n = 8 Output: 3 Explanation: 8 -> 4 -> 2 -> 1
Example 2:
Input: n = 7 Output: 4 Explanation: 7 -> 8 -> 4 -> 2 -> 1 or 7 -> 6 -> 3 -> 2 -> 1
Example 3:
Input: n = 4 Output: 2
Constraints:
1 <= n <= 231 - 1Solutions for this problem are being prepared.
Try solving it yourselfLongest Repeating Character Replacement - Leetcode 424 - Python • NeetCode • 599,364 views views
Watch 9 more video solutions →Practice Integer Replacement with our built-in code editor and test cases.
Practice on FleetCode