leetcode-problemset/leetcode-cn/problem (English)/翻转数位(English) [reverse-bits-lcci].html

<p>You have an integer and you can flip exactly one bit from a 0 to a 1. Write code to find the length of the longest sequence of 1s you could create.</p>

<p><strong>Example 1: </strong></p>

<pre>
<strong>Input:</strong> <code>num</code> = 1775(11011101111<sub>2</sub>)
<strong>Output:</strong> 8
</pre>

<p><strong>Example 2: </strong></p>

<pre>
<strong>Input:</strong> <code>num</code> = 7(0111<sub>2</sub>)
<strong>Output:</strong> 4
</pre>