Solution (leetcode-in-java 1.23 API)

java.lang.Object
- g2501_2600.s2571_minimum_operations_to_reduce_an_integer_to_0.Solution

```
public class Solution
extends Object
```
2571 - Minimum Operations to Reduce an Integer to 0.
Medium

You are given a positive integer n, you can do the following operation any number of times:
- Add or subtract a power of 2 from n.
Return the minimum number of operations to make n equal to 0.

A number x is power of 2 if x == 2ⁱ where i >= 0.

Example 1:

Input: n = 39

Output: 3

Explanation: We can do the following operations:
- Add 2⁰ = 1 to n, so now n = 40.
- Subtract 2³ = 8 from n, so now n = 32.
- Subtract 2⁵ = 32 from n, so now n = 0. It can be shown that 3 is the minimum number of operations we need to make n equal to 0.
Example 2:

Input: n = 54

Output: 3

Explanation: We can do the following operations:
- Add 2¹ = 2 to n, so now n = 56.
- Add 2³ = 8 to n, so now n = 64.
- Subtract 2⁶ = 64 from n, so now n = 0. So the minimum number of operations is 3.
Constraints:
- 1 <= n <= 10⁵

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int minOperations(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- minOperations
```
public int minOperations(int n)
```