public class test {
public int smallestFactorization(int a){
if(a <= 1){
return a;
}
long b = 0;
long tmp = 1;
for(int i=9; i>1; i--){
while(a % i == 0){
a /= i;
b = tmp * i + b;
tmp *= 10;
}
}
return a == 1 && b <= Integer.MAX_VALUE ? (int)b : 0;
}
}
leetcode625
最新推荐文章于 2021-10-11 14:10:39 发布