약수의 개수와 덧셈

class Solution {
    public int solution(int left, int right) {
        int count = 0;
        int sum = 0;

        for (int i = left; left <= right; left++) {
            for (int j = 1; j <= left; j++) {
                if (left % j == 0) {
                    count++;
                }
            }
            if (count % 2 == 0) {
                sum += left;
            } else {
                sum -= left;
            }
            count = 0;
        }
        return sum;
    }
}