{leetcode}/problems/reordered-power-of-2/[LeetCode - Reordered Power of 2^]
Starting with a positive 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 in a way such that the resulting number is a power of 2.
Example 1:
Input: 1 Output: true
Example 2:
Input: 10 Output: false
Example 3:
Input: 16 Output: true
Example 4:
Input: 24 Output: false
Example 5:
Input: 46 Output: true
Note:
-
1 <= N <= 10^9
根据数字，对其对应的字符数组进行排序，然后再取得其对应的字符串。
一次计算 2 的幂次方，然后在字符串长度相等的情况下，排序其对应的字符数组，再转化成字符串跟参数的字符串想比较。
- 一刷
-
link:{sourcedir}/_0869_ReorderedPowerOf2.java[role=include]