#1611 - Minimum One Bit Operations to Make Integers Zero

Hard • View on LeetCode • View on GitHub

Dynamic Programming Bit Manipulation Memoization

Problem Description

Given an integer n, you must transform it into 0 using the following operations any number of times:

Change the rightmost (0th) bit in the binary representation of n.
Change the ith bit in the binary representation of n if the (i-1)th bit is set to 1 and the (i-2)th through 0th bits are set to 0.

Return the minimum number of operations to transform n into 0.

Solution

/**
 * @param {number} n
 * @return {number}
 */
var minimumOneBitOperations = function(n) {
  if (n === 0) return 0;

  let result = 0;
  let bit = 1;
  while (bit <= n) {
    if (n & bit) {
      result = (1 << (bit.toString(2).length)) - 1 - result;
    }
    bit <<= 1;
  }

  return result;
};