leetcode-397. Integer Replacement

一、问题描述

Given a positive integer n and you can do operations as follow:

1. If n is even, replace n with n/2.
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

二、思路分析

按着题意构造递归，涉及到整数溢出，故采用 long long类型。

三、代码

class Solution {
public:
    int integerReplacement(int n) {
        if (n == 1) {
            return 0;
        }
        if (n % 2 == 0) {
            return 1+integerReplacement(n/2);
        } else {
            long long p = n;
            return 2+min(integerReplacement((p+1)/2), integerReplacement((p-1)/2));
        }
    }
};