number-complement

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

The complement of an integer is the integer you get when you flip all the <code>0</code>&#39;s to <code>1</code>&#39;s and all the <code>1</code>&#39;s to <code>0</code>&#39;s in its binary representation.

<ul>
	<li>For example, The integer <code>5</code> is <code>&quot;101&quot;</code> in binary and its complement is <code>&quot;010&quot;</code> which is the integer <code>2</code>.</li>
</ul>

Given an integer <code>num</code>, return its complement.

&nbsp;
Example 1:

<pre>
Input: num = 5
Output: 2
Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.
</pre>

Example 2:

<pre>
Input: num = 1
Output: 0
Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= num &lt; 231</code></li>
</ul>

&nbsp;
Note: This question is the same as 1009: <a href="https://leetcode.com/problems/complement-of-base-10-integer/" target="_blank">https://leetcode.com/problems/complement-of-base-10-integer/</a>

findComplement

Number Complement

Bit Manipulation

&#23545;&#25972;&#25968;&#30340;&#20108;&#36827;&#21046;&#34920;&#31034;&#21462;&#21453;&#65288;<code>0</code> &#21464; <code>1</code> &#65292;<code>1</code> &#21464; <code>0</code>&#65289;&#21518;&#65292;&#20877;&#36716;&#25442;&#20026;&#21313;&#36827;&#21046;&#34920;&#31034;&#65292;&#21487;&#20197;&#24471;&#21040;&#36825;&#20010;&#25972;&#25968;&#30340;&#34917;&#25968;&#12290;

<ul>
	<li>&#20363;&#22914;&#65292;&#25972;&#25968; <code>5</code> &#30340;&#20108;&#36827;&#21046;&#34920;&#31034;&#26159; <code>"101"</code> &#65292;&#21462;&#21453;&#21518;&#24471;&#21040; <code>"010"</code> &#65292;&#20877;&#36716;&#22238;&#21313;&#36827;&#21046;&#34920;&#31034;&#24471;&#21040;&#34917;&#25968; <code>2</code> &#12290;</li>
</ul>

&#32473;&#20320;&#19968;&#20010;&#25972;&#25968; <code>num</code> &#65292;&#36755;&#20986;&#23427;&#30340;&#34917;&#25968;&#12290;

&nbsp;

<ol>
</ol>

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

<pre>
&#36755;&#20837;&#65306;num = 5
&#36755;&#20986;&#65306;2
&#35299;&#37322;&#65306;5 &#30340;&#20108;&#36827;&#21046;&#34920;&#31034;&#20026; 101&#65288;&#27809;&#26377;&#21069;&#23548;&#38646;&#20301;&#65289;&#65292;&#20854;&#34917;&#25968;&#20026; 010&#12290;&#25152;&#20197;&#20320;&#38656;&#35201;&#36755;&#20986; 2 &#12290;
</pre>

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

<pre>
&#36755;&#20837;&#65306;num = 1
&#36755;&#20986;&#65306;0
&#35299;&#37322;&#65306;1 &#30340;&#20108;&#36827;&#21046;&#34920;&#31034;&#20026; 1&#65288;&#27809;&#26377;&#21069;&#23548;&#38646;&#20301;&#65289;&#65292;&#20854;&#34917;&#25968;&#20026; 0&#12290;&#25152;&#20197;&#20320;&#38656;&#35201;&#36755;&#20986; 0 &#12290;
</pre>

&nbsp;

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

<ul>
	<li><code>1 &lt;= num &lt; 231</code></li>
</ul>

&nbsp;

&#27880;&#24847;&#65306;&#26412;&#39064;&#19982; 1009 <a href="https://leetcode.cn/problems/complement-of-base-10-integer/">https://leetcode.cn/problems/complement-of-base-10-integer/</a> &#30456;&#21516;

Sunbelt Computer Software

PL/B Language Development and Support