从正整数 N 开始,我们按任何顺序(包括原始顺序)将数字重新排序,注意其前导数字不能为零。
如果我们可以通过上述方式得到 2 的幂,返回 true
;否则,返回 false
。
示例 1:
输入:1
输出:true
示例 2:
输入:10
输出:false
示例 3:
输入:16
输出:true
示例 4:
输入:24
输出:false
示例 5:
输入:46
输出:true
提示:
1. 1 <= N <= 10^9
思路:
初看这道题,能想到的是暴力排序,然后log2。但这道题有一个条件:注意其前导数字不能为零
。这样的话位数就是固定的。那么位数和2的幂不同的肯定不行。第二个条件:1 <= N <= 10^9
。那么N< 2^30=1073741824。这样符合的2的幂只有31个。之后用哈希去判断N的每一个数的个数是否与2的幂相同即可。
python代码:
class Solution:
def reorderedPowerOf2(self, N):
"""
:type N: int
:rtype: bool
"""
num = ["1","2","4","8","16","32","64","128","256","512","1024","2048","4096","8192","16384","32768","65536","131072","262144","524288","1048576","2097152","4194304","8388608","16777216","33554432","67108864","134217728","268435456","536870912","1073741824"]
hash1 = None
hash2 = None
s = str(N)
for i in range(0,31) :
if len(s) < len(num[i]) :
return False
if len(s) == len(num[i]) :
hash1 = [0 for j in range(0,10)]
hash2 = [0 for j in range(0,10)]
for j in range(0,len(num[i])) :
hash1[int(s[j])] += 1
hash2[int(num[i][j])] += 1
for j in range(0,10) :
if hash1[j] != hash2[j] :
break
if j == 9 : return True
return False