[programmers][X] n^2 배열 자르기

05 Jun 2023 in Algorithm on Algorithm

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

class Solution {
    public int[] solution(int n, long left, long right) {
        int[] answer = new int[ (int) (right-left) + 1];

        for(long i = left ; i <= right ; i++){
            answer[(int) (i-left)] = (int) Math.max( i/n , i%n ) + 1;
        }

        return answer;
    }
}