Skip to content

Latest commit

 

History

History
77 lines (48 loc) · 1.25 KB

File metadata and controls

77 lines (48 loc) · 1.25 KB

中文文档

Description

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

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

 

Example 1:

Input: n = 1
Output: true

Example 2:

Input: n = 10
Output: false

Example 3:

Input: n = 16
Output: true

Example 4:

Input: n = 24
Output: false

Example 5:

Input: n = 46
Output: true

 

Constraints:

  • 1 <= n <= 109

Solutions

Python3

Java

...