首页 > 代码库 > LeetCode 397. Integer Replacement
LeetCode 397. Integer Replacement
397. Integer Replacement
My Submissions
- Total Accepted: 5878
- Total Submissions: 21519
- Difficulty: Easy
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 + 1orn - 1.
What is the minimum number of replacements needed for n to become 1?
Example 1:
Input:8Output:3Explanation:8 -> 4 -> 2 -> 1
Example 2:
Input:7Output:4Explanation:7 -> 8 -> 4 -> 2 -> 1or7 -> 6 -> 3 -> 2 -> 1
Subscribe to see which companies asked this question
这个题目没思路，参考了别人的想法 网址：https://discuss.leetcode.com/topic/58334/a-couple-of-java-solutions-with-explanations
class Solution {public: int integerReplacement(int n) { if(INT_MAX==n)return 32; //INT_MAX是个特殊值，如果加1就越界了
//我们也可以用long long 类型的数令它等于n，如 long long N=n;然后把下面的n替换成N即可
int c = 0; while (n != 1) { if ((n & 1) == 0) { n /= 2; } else if (n == 3 || ((n) & (1<<1)) == 0) { //留意后两位 奇数是最后一位是1 如果倒数第二位是0那么减1 使得1的位数更少 --n; } else { ++n; } ++c; } return c; }};
LeetCode 397. Integer Replacement
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。