programmers_n^2 배열 자르기_java

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

프로그래머스

class Solution {
    public int[] solution(int n, long left, long right) {
        int[] answer = {};
        
        answer = createMap(n, left, right);
        
        return answer;
    }
    
    public int[] createMap(int n, long left, long right){
        int mapSize = (int)(right - left) + 1;
        int[] map = new int[mapSize];
        int idx = 0;
        while (right - left >= 0){
            map[idx++] = (int)(Math.max(left/n, left%n)) + 1; // 행과 열 값 비교 -> 큰 값 +1
            left++;
        }
        return map;
    }
    
    
    public void printMap(int[] map){
        System.out.println();
        for(int i= 0; i<map.length; i++){
            System.out.print(map[i] + " ");
        }
        System.out.println();
    }
}