#397
Integer Replacement
expert · 1070 · lc medium +32 · verified · 37.2% accepted · 1,434 likes · top 15%
Description
Given a positive integer n, at each step apply exactly one of the following rules:
- If n is even, replace n with n / 2.
- If n is odd, replace n with either n + 1 or n - 1.
Return the minimum number of steps required to reach 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
Code
1
2
3