题目
代码部分(6ms 99.21%)
class Solution {
public List<Integer> powerfulIntegers(int x, int y, int bound) {
Set<Integer> set = new HashSet();
//List<Integer> res = new ArrayList();
for(int i = 0; i <= 18; i++){
int tmp = (int)Math.pow(x, i);
if(tmp > bound){
break;
}
for(int j = 0; j <= 18; j++){
int temp = tmp + (int)Math.pow(y, j);
if(temp > bound){
break;
}
set.add(temp);
}
}
//for(int val : set){
// res.add(val);
//}
return new ArrayList(set);
}
}