coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 03:26:45 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,15 +1,15 @@
<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>
<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>