Given an integer array nums, return the sum of divisors of the integers in that array that have exactly four divisors.
If there is no such integer in the array, return 0.
Example 1:
Input: nums = [21,4,7]
Output: 32
Explanation:
21 has 4 divisors: 1, 3, 7, 21
4 has 3 divisors: 1, 2, 4
7 has 2 divisors: 1, 7
The answer is the sum of divisors of 21 only.
Constraints:
1 <= nums.length <= 10^4
1 <= nums[i] <= 10^5
Solution:
class Solution {
public int sumFourDivisors(int[] nums) {
int n = nums.length;
int sum = 0;
for (int i = 0; i < n; i ++) {
int val = nums[i];
Set<Integer> divisors = new HashSet();
for (int d = 1; d * d <= val; d ++) {
if (val % d == 0) {
divisors.add(d);
divisors.add(val / d);
}
if (divisors.size() > 4) break;
}
if (divisors.size() == 4) {
for (int d : divisors) {
sum += d;
}
}
}
return sum;
}
}