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
参考资料:
https://leetcode.com/problems/reordered-power-of-2/
LeetCode All in One 题目讲解汇总(持续更新中...)
原文地址:https://www.cnblogs.com/grandyang/p/10747839.html
时间: 2024-10-15 22:26:10