Given a positive integer n and you can do operations as follow:
If n is even, replace n with n/2.
If n is odd, you can replace n with either n + 1 or n - 1.
What is the minimum number of replacements needed for n to become 1?
Example 1:
Input:
8
Output:
3
Explanation:
8 -> 4 -> 2 -> 1
Example 2:
Input:
7
Output:
4
Explanation:
7 -> 8 -> 4 -> 2 -> 1
or
7 -> 6 -> 3 -> 2 -> 1
思路：
Time Complexity: O(N) Space Complexity: O(N)
Solution Code：
题目：397. Integer Replacement[Medium] Given a positive inte...
Given a positive integer n and you can do operations as f...
Given a positive integer n and you can do operations as f...
Description: Given a positive integer n and you can do op...
Given a positive integer n and you can do operations as f...
又碰到一个很有意思的题目，拿过来纪录一下过程。首先，我使用了Dynamic Programming的方法： 当n达...
题目来源给一个数，求经过多少次变换变为1。我一开始想着直接用DP，但是想想应该会内存溢出。 然后果然就溢出了。然后...
My code: reference:https://discuss.leetcode.com/topic/584...
一、问题链接：https://leetcode.com/problems/integer-replacement/...
本文标题：397. Integer Replacement
本文链接：https://www.haomeiwen.com/subject/rqryoxtx.html
网友评论