给定两个正整数 x
和 y
,如果某一整数等于 x^i + y^j
,其中整数 i >= 0
且 j >= 0
,那么我们认为该整数是一个强整数。
返回值小于或等于 bound
的所有强整数组成的列表。
你可以按任何顺序返回答案。在你的回答中,每个值最多出现一次。
示例 1:
输入:x = 2, y = 3, bound = 10 输出:[2,3,4,5,7,9,10] 解释: 2 = 2^0 + 3^0 3 = 2^1 + 3^0 4 = 2^0 + 3^1 5 = 2^1 + 3^1 7 = 2^2 + 3^1 9 = 2^3 + 3^0 10 = 2^0 + 3^2
示例 2:
输入:x = 3, y = 5, bound = 15 输出:[2,4,6,8,10,14]
提示:
1 <= x <= 100
1 <= y <= 100
0 <= bound <= 10^6
class Solution {
public:
vector<int> powerfulIntegers(int x, int y, int bound) {
if (x <= 0 || y <= 0 || bound < 0) {
return vector<int> ();
}
unordered_set<int> res;
int i = 0, j = 0;
vector<int> dx, dy;
Permute(x, y, i, j, dx, dy, bound, res);
return vector<int>(res.begin(), res.end());
}
void Permute(int x, int y, int i, int j, vector<int>& dx, vector<int>& dy,
int bound, unordered_set<int>& res) {
if (i > 20 || j > 20) {
return;
}
if (i >= dx.size()) {
int val = Power(x, i);
dx.push_back(val);
}
if (j >= dy.size()) {
int val = Power(y, j);
dy.push_back(val);
}
int s = dx[i] + dy[j];
if (s > bound) {
return ;
} else {
if (res.insert(s).second == false) {
return ;
}
}
Permute(x, y, i + 1, j, dx, dy, bound, res);
Permute(x, y, i, j + 1, dx, dy, bound, res);
}
int Power(int base, int i) {
if (base == 0 || base == 1) {
return base;
}
int result = 1;
while (i > 0) {
result *= base;
i -= 1;
}
return result;
}
};