Programmers [Java] - Lv. 0 : 리스트 자르기

import java.util.ArrayList;

class Solution
{
    public int[] solution(int n, int[] slicer, int[] num_list)
	{
		
		int stNum = slicer[0];	//-- 반복 시작값 (a)
		int endNum = slicer[1];	//-- 반복 끝 값  (b)
		int incNum = 1;			//-- 증가 값
		
		ArrayList<Integer> addNumList = new ArrayList<Integer>();
		int[] result;
		
		switch (n)
		{
			case 1:
				stNum = 0;
				break;
			case 2:
				endNum = num_list.length - 1;
				break;
			case 4:
				incNum = slicer[2];
				break;
		}
		
		for (int i = stNum; i <= endNum; i += incNum)
			addNumList.add(num_list[i]);
		
		result = new int[addNumList.size()];
		
		for (int i = 0; i < result.length; i++)
			result[i] = addNumList.get(i);
		
		return result;
	}
}