【Leetcode_easy】970. Powerful Integers

problem

970. Powerful Integers

solution:

class Solution {
public:
    vector<int> powerfulIntegers(int x, int y, int bound) {
        unordered_set<int> tmp;
        for(int a=1; a<bound; a*=x)//
        {
            for(int b=1; a+b<=bound; b*=y)
            {
                tmp.insert(a+b);//
                if(y==1) break;//
            }
            if(x==1) break;
        }
        return vector<int>(tmp.begin(), tmp.end());
    }

};

参考

1. Leetcode_easy_970. Powerful Integers;

完