bool reorderedPowerOf2(int n){
int a[10]={0};
int b[10]={0};
int count=0;
while(n){
a[n%10]++;
n=n/10;
count++;
}
int sum=1;
for(int c=0;c<30;c++){
int sum1=sum;
int count1=0;
while(sum1){
b[sum1%10]++;
sum1=sum1/10;
count1++;
}
int count2=0;
if(count==count1){
for(int d=0;d<10;d++){
if(a[d]==b[d]){
count2++;
}
}
}
if(count1>count){
break;
}
for(int d=0;d<10;d++){
b[d]=0;
}
if(count2==10){
return true;
}
sum=sum*2;
}
return false;
}
05-31
04-23
191
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
09-16
586
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
11-22
5771
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
10-28
101
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
07-24
910
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)