g0901_1000.s0970_powerful_integers.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

The newest version!

package g0901_1000.s0970_powerful_integers;

// #Medium #Hash_Table #Math #2022_03_31_Time_1_ms_(100.00%)_Space_42.3_MB_(27.54%)

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;

public class Solution {
    public List powerfulIntegers(int x, int y, int bound) {
        int iBound = (x == 1 ? 1 : (int) (Math.log10(bound) / Math.log10(x)));
        int jBound = (y == 1 ? 1 : (int) (Math.log10(bound) / Math.log10(y)));
        HashSet set = new HashSet<>();
        for (int i = 0; i <= iBound; i++) {
            for (int j = 0; j <= jBound; j++) {
                int number = (int) (Math.pow(x, i) + Math.pow(y, j));
                if (number <= bound) {
                    set.add(number);
                }
            }
        }
        return new ArrayList<>(set);
    }
}