Four Divisors LeetCode solution in Java

1
class Solution {
2
  public int sumFourDivisors(int[] nums) {
3
    int res = 0;
4
    for (int val : nums) {
5
      int sum = 0;
6
      int count = 0;
7
      for (int i = 1; i * i <= val; i++) {
8
        if (val % i == 0) {
9
          sum += i;
10
          count++;
11
          if (i != val / i) {
12
            sum += val / i;
13
            count++;
14
          }
15
        }
16
      }
17
      if (count == 4) {
18
        res += sum;
19
      }
20
    }
21
    return res;
22
  }
23
}