LC-0397 Medium LeetCode

397. Integer Replacement

Dynamic Programming Greedy Bit Manipulation Memoization

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 36% Topics: Dynamic Programming, Greedy, Bit Manipulation, Memoization

Reading material

1-D Dynamic Programming 16 min Greedy 11 min Bit Manipulation 10 min

Reference solution (spoiler · python)

# Time:  O(logn)
# Space: O(1)

class Solution(object):
    def integerReplacement(self, n):
        """
        :type n: int
        :rtype: int
        """
        result = 0
        while n != 1:
            b = n & 3
            if n == 3:
                n -= 1
            elif b == 3:
                n += 1
            elif b == 1:
                n -= 1
            else:
                n /= 2
            result += 1

        return result


# Time:  O(logn)
# Space: O(logn)
# Recursive solution.
class Solution2(object):
    def integerReplacement(self, n):
        """
        :type n: int
        :rtype: int
        """
        if n < 4:
            return [0, 0, 1, 2][n]
        if n % 4 in (0, 2):
            return self.integerReplacement(n / 2) + 1
        elif n % 4 == 1:
            return self.integerReplacement((n - 1) / 4) + 3
        else:
            return self.integerReplacement((n + 1) / 4) + 3

Solution from kamyu104/LeetCode-Solutions · MIT