1611-minimum-one-bit-operations-to-make-integers-zero.adoc

1611. Minimum One Bit Operations to Make Integers Zero

{leetcode}/problems/minimum-one-bit-operations-to-make-integers-zero/[LeetCode - 1611. Minimum One Bit Operations to Make Integers Zero ^]

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".
"1#1" -> "[.underline]#0#1" with the 2nd operation since the 0th bit is 1.
"0[.underline]#1" -> "0[.underline]0" with the 1st operation.

Example 2:

Input: n = 6
Output: 4
Explanation: The binary representation of 6 is "110".
"1#10" -> "[.underline]#0#10" with the 2nd operation since the 1st bit is 1 and 0th through 0th bits are 0.
"01[.underline]#0" -> "01[.underline]1" with the 1st operation.
"0[.underline]1#1" -> "0[.underline]#0#1" with the 2nd operation since the 0th bit is 1.
"00[.underline]#1" -> "00[.underline]0" with the 1st operation.

Constraints:

• 0 ⇐ n ⇐ 109

思路分析

一刷

link:{sourcedir}/_1611_MinimumOneBitOperationsToMakeIntegersZero.java[role=include]

参考资料