mediumBit ManipulationDynamic ProgrammingGreedyMemoization 0 views
Integer Replacement
Given a positive integer n, you can apply one of the following operations: Return the minimum number of operations needed for n to become 1.
Given a positive integer n, you can apply one of the following operations:
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 - 1
Hints
No hints yet.
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.