Cacher is the code snippet organizer for pro developers

int[] primeFactors2(int n) {
    Set<Integer> res = new HashSet<>();
    for (int i = 2; i <= n; i++) {
        if (n % i == 0) {
            boolean found = false;
            for (Integer al : res) if (i % al == 0) found = true;
            if (!found) res.add(i);
        }
    }
    int[] ret = new int[res.size()];
    int k = 0;
    for (int i : res) ret[k++] = i;
    return ret;
}