n^2 배열 자르기

class Solution {
    public long[] solution(int n, long left, long right) {
        int len = (int) right - (int) left + 1;
        long[] answer = new long[len];
 
        long pos = left;
        for(int i=0;i<len;i++){
            long a = pos % n + 1;
            long b = pos / n + 1;
            if(a > b)
                answer[i] = a;
            else
                answer[i] = b;
            pos++;
        }
        return answer;
    }
}