mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
14 lines
457 B
HTML
14 lines
457 B
HTML
<p>给定一个32位整数 <code>num</code>，你可以将一个数位从0变为1。请编写一个程序，找出你能够获得的最长的一串1的长度。</p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre><strong>输入:</strong> <code>num</code> = 1775(11011101111<sub>2</sub>)
|
||
<strong>输出:</strong> 8
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre><strong>输入:</strong> <code>num</code> = 7(0111<sub>2</sub>)
|
||
<strong>输出:</strong> 4
|
||
</pre>
|