Package g1601_1700.s1611_minimum_one_bit_operations_to_make_integers_zero

Class Solution

java.lang.Object

g1601_1700.s1611_minimum_one_bit_operations_to_make_integers_zero.Solution

public class Solution
extends Object

1611 - Minimum One Bit Operations to Make Integers Zero\. Hard 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`_._ **Example 1:** **Input:** n = 3 **Output:** 2 **Explanation:** The binary representation of 3 is "11". "11" -> "01" with the 2^nd operation since the 0^th bit is 1. "01" -> "00" with the 1^st operation. **Example 2:** **Input:** n = 6 **Output:** 4 **Explanation:** The binary representation of 6 is "110". "110" -> "010" with the 2^nd operation since the 1^st bit is 1 and 0^th through 0^th bits are 0. "010" -> "011" with the 1^st operation. "011" -> "001" with the 2^nd operation since the 0^th bit is 1. "001" -> "000" with the 1^st operation. **Constraints:** * 0 <= n <= 109

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	minimumOneBitOperations(int n)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minimumOneBitOperations

public int minimumOneBitOperations(int n)