binary-gap

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given a positive integer <code>n</code>, find and return the longest distance between any two adjacent <code>1</code>&#39;s in the binary representation of <code>n</code>. If there are no two adjacent <code>1</code>&#39;s, return <code>0</code>.

Two <code>1</code>&#39;s are adjacent if there are only <code>0</code>&#39;s separating them (possibly no <code>0</code>&#39;s). The distance between two <code>1</code>&#39;s is the absolute difference between their bit positions. For example, the two <code>1</code>&#39;s in <code>&quot;1001&quot;</code> have a distance of 3.

&nbsp;
Example 1:

<pre>
Input: n = 22
Output: 2
Explanation: 22 in binary is &quot;10110&quot;.
The first adjacent pair of 1&#39;s is &quot;10110&quot; with a distance of 2.
The second adjacent pair of 1&#39;s is &quot;10110&quot; with a distance of 1.
The answer is the largest of these two distances, which is 2.
Note that &quot;10110&quot; is not a valid pair since there is a 1 separating the two 1&#39;s underlined.
</pre>

Example 2:

<pre>
Input: n = 8
Output: 0
Explanation: 8 in binary is &quot;1000&quot;.
There are not any adjacent pairs of 1&#39;s in the binary representation of 8, so we return 0.
</pre>

Example 3:

<pre>
Input: n = 5
Output: 2
Explanation: 5 in binary is &quot;101&quot;.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>

&#31532; 93 &#22330;&#21608;&#36187;

weekly-contest-93

binaryGap

&#20013;&#32423;&#24037;&#31243;&#24072;

Binary Gap

Bit Manipulation

&#32473;&#23450;&#19968;&#20010;&#27491;&#25972;&#25968; <code>n</code>&#65292;&#25214;&#21040;&#24182;&#36820;&#22238; <code>n</code> &#30340;&#20108;&#36827;&#21046;&#34920;&#31034;&#20013;&#20004;&#20010; &#30456;&#37051; 1 &#20043;&#38388;&#30340; &#26368;&#38271;&#36317;&#31163; &#12290;&#22914;&#26524;&#19981;&#23384;&#22312;&#20004;&#20010;&#30456;&#37051;&#30340; 1&#65292;&#36820;&#22238; <code>0</code> &#12290;

&#22914;&#26524;&#21482;&#26377; <code>0</code> &#23558;&#20004;&#20010; <code>1</code> &#20998;&#38548;&#24320;&#65288;&#21487;&#33021;&#19981;&#23384;&#22312; <code>0</code> &#65289;&#65292;&#21017;&#35748;&#20026;&#36825;&#20004;&#20010; 1 &#24444;&#27492; &#30456;&#37051; &#12290;&#20004;&#20010; <code>1</code> &#20043;&#38388;&#30340;&#36317;&#31163;&#26159;&#23427;&#20204;&#30340;&#20108;&#36827;&#21046;&#34920;&#31034;&#20013;&#20301;&#32622;&#30340;&#32477;&#23545;&#24046;&#12290;&#20363;&#22914;&#65292;<code>"1001"</code> &#20013;&#30340;&#20004;&#20010; <code>1</code> &#30340;&#36317;&#31163;&#20026; 3 &#12290;

&nbsp;

<ul>
</ul>

&#31034;&#20363; 1&#65306;

<pre>
&#36755;&#20837;&#65306;n = 22
&#36755;&#20986;&#65306;2
&#35299;&#37322;&#65306;22 &#30340;&#20108;&#36827;&#21046;&#26159; "10110" &#12290;
&#22312; 22 &#30340;&#20108;&#36827;&#21046;&#34920;&#31034;&#20013;&#65292;&#26377;&#19977;&#20010; 1&#65292;&#32452;&#25104;&#20004;&#23545;&#30456;&#37051;&#30340; 1 &#12290;
&#31532;&#19968;&#23545;&#30456;&#37051;&#30340; 1 &#20013;&#65292;&#20004;&#20010; 1 &#20043;&#38388;&#30340;&#36317;&#31163;&#20026; 2 &#12290;
&#31532;&#20108;&#23545;&#30456;&#37051;&#30340; 1 &#20013;&#65292;&#20004;&#20010; 1 &#20043;&#38388;&#30340;&#36317;&#31163;&#20026; 1 &#12290;
&#31572;&#26696;&#21462;&#20004;&#20010;&#36317;&#31163;&#20043;&#20013;&#26368;&#22823;&#30340;&#65292;&#20063;&#23601;&#26159; 2 &#12290;
</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;n = 8
&#36755;&#20986;&#65306;0
&#35299;&#37322;&#65306;8 &#30340;&#20108;&#36827;&#21046;&#26159; "1000" &#12290;
&#22312; 8 &#30340;&#20108;&#36827;&#21046;&#34920;&#31034;&#20013;&#27809;&#26377;&#30456;&#37051;&#30340;&#20004;&#20010; 1&#65292;&#25152;&#20197;&#36820;&#22238; 0 &#12290;
</pre>

&#31034;&#20363; 3&#65306;

<pre>
&#36755;&#20837;&#65306;n = 5
&#36755;&#20986;&#65306;2
&#35299;&#37322;&#65306;5 &#30340;&#20108;&#36827;&#21046;&#26159; "101" &#12290;
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<ul>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>

Sunbelt Computer Software

PL/B Language Development and Support