1611. Minimum One Bit Operations to Make Integers Zero Hard

1/**
2 * [1611] Minimum One Bit Operations to Make Integers Zero
3 *
4 * Given an integer n, you must transform it into 0 using the following operations any number of times:
5 * 
6 * 	Change the rightmost (0^th) bit in the binary representation of n.
7 * 	Change the i^th bit in the binary representation of n if the (i-1)^th bit is set to 1 and the (i-2)^th through 0^th bits are set to 0.
8 * 
9 * Return the minimum number of operations to transform n into 0.
10 *  
11 * Example 1:
12 * 
13 * Input: n = 3
14 * Output: 2
15 * Explanation: The binary representation of 3 is "11".
16 * "<u>1</u>1" -> "<u>0</u>1" with the 2^nd operation since the 0^th bit is 1.
17 * "0<u>1</u>" -> "0<u>0</u>" with the 1^st operation.
18 * 
19 * Example 2:
20 * 
21 * Input: n = 6
22 * Output: 4
23 * Explanation: The binary representation of 6 is "110".
24 * "<u>1</u>10" -> "<u>0</u>10" with the 2^nd operation since the 1^st bit is 1 and 0^th through 0^th bits are 0.
25 * "01<u>0</u>" -> "01<u>1</u>" with the 1^st operation.
26 * "0<u>1</u>1" -> "0<u>0</u>1" with the 2^nd operation since the 0^th bit is 1.
27 * "00<u>1</u>" -> "00<u>0</u>" with the 1^st operation.
28 * 
29 *  
30 * Constraints:
31 * 
32 * 	0 <= n <= 10^9
33 * 
34 */
35pub struct Solution {}
36
37// problem: https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/
38// discuss: https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/discuss/?currentPage=1&orderBy=most_votes&query=
39
40// submission codes start here
41
42impl Solution {
43    pub fn minimum_one_bit_operations(n: i32) -> i32 {
44        0
45    }
46}
47
48// submission codes end
49
50#[cfg(test)]
51mod tests {
52    use super::*;
53
54    #[test]
55    fn test_1611() {
56    }
57}
58