[프로그래머스] n^2 배열 자르기 java 풀이(LEVEL2)

https://school.programmers.co.kr/learn/courses/30/lessons/87390

프로그래머스

 

나의풀이

import java.util.*;
class Solution {
    public int[] solution(int n, long left, long right) {
        int[] answer = new int[(int)(right-left+1)];
        
        for(int i=0; i<answer.length;i++){
            answer[i] = Math.max((int)(left/n +1), (int)(left%n +1));
            left++;
        }
        return answer;
    }
}