reordered-power-of-2

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an integer <code>n</code>. We reorder the digits in any order (including the original order) such that the leading digit is not zero.

Return <code>true</code> if and only if we can do this so that the resulting number is a power of two.

&nbsp;
Example 1:

<pre>
Input: n = 1
Output: true
</pre>

Example 2:

<pre>
Input: n = 10
Output: false
</pre>

&nbsp;
Constraints:

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

reorderedPowerOf2

Reordered Power of 2

Hash Table

Math

Counting

Enumeration

Sorting

给定正整数&nbsp;<code>n</code>&nbsp;，我们按任何顺序（包括原始顺序）将数字重新排序，注意其前导数字不能为零。

如果我们可以通过上述方式得到&nbsp;2 的幂，返回 <code>true</code>；否则，返回 <code>false</code>。

&nbsp;

<ol>
</ol>

示例 1：

<pre>
输入：n = 1
输出：true
</pre>

示例 2：

<pre>
输入：n = 10
输出：false
</pre>

&nbsp;

提示：

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