https://school.programmers.co.kr/learn/courses/30/lessons/131701
구현 한번만에 성공!
import java.util.*;
class Solution {
public int solution(int[] elements) {
int answer = 0;
HashSet<Integer> set = new HashSet<>();
int maxlen = elements.length;
int curlen = 1;
for(int i = 1; i <= maxlen; ++i)
{
curlen = i;
for(int j = 0; j < maxlen; ++j)
{
int sum = 0;
for(int k = 0; k < curlen; ++k)
{
int cur = j+k;
if(cur >= maxlen)
cur-=maxlen;
sum += elements[cur];
}
set.add(sum);
}
}
answer = set.size();
return answer;
}
}