mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
42 lines
1.4 KiB
HTML
42 lines
1.4 KiB
HTML
<p>You are given a positive integer <code>n</code>, you can do the following operation <strong>any</strong> number of times:</p>
|
|
|
|
<ul>
|
|
<li>Add or subtract a <strong>power</strong> of <code>2</code> from <code>n</code>.</li>
|
|
</ul>
|
|
|
|
<p>Return <em>the <strong>minimum</strong> number of operations to make </em><code>n</code><em> equal to </em><code>0</code>.</p>
|
|
|
|
<p>A number <code>x</code> is power of <code>2</code> if <code>x == 2<sup>i</sup></code> where <code>i >= 0</code><em>.</em></p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 39
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> We can do the following operations:
|
|
- Add 2<sup>0</sup> = 1 to n, so now n = 40.
|
|
- Subtract 2<sup>3</sup> = 8 from n, so now n = 32.
|
|
- Subtract 2<sup>5</sup> = 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.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 54
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> We can do the following operations:
|
|
- Add 2<sup>1</sup> = 2 to n, so now n = 56.
|
|
- Add 2<sup>3</sup> = 8 to n, so now n = 64.
|
|
- Subtract 2<sup>6</sup> = 64 from n, so now n = 0.
|
|
So the minimum number of operations is 3.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= n <= 10<sup>5</sup></code></li>
|
|
</ul>
|