2024.01.10 - 1문제

 

리스트 자르기

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

프로그래머스

class Solution {
    public int[] solution(int n, int[] slicer, int[] num_list) {
        int[] answer;
        int a = slicer[0];
        int b = slicer[1];
        int c = slicer[2];
        
        
        if (n==1) {
            answer = new int[b+1];
            int index = 0;
            for(int i=0; i<b+1; i++) {
                answer[index] = num_list[i];
                index++;
            }
        } else if (n==2) {
            answer = new int[num_list.length-a];
            int index = 0;
            for(int i=a; i<num_list.length; i++) {
                answer[index] = num_list[i];
                index++;
            }
        } else if (n==3) {
            answer = new int[b-a+1];
            int index = 0;
            for(int i=a; i<b+1; i++) {
                answer[index] = num_list[i];
                index++;
            }
        } else {
            answer = new int[(b-a)/c + 1];
            int index = 0;
            for(int i=a; i<b+1; i+=c) {
                answer[index] = num_list[i];
                index++;
            }
        }
        
        return answer;
    }
}