짝수는 싫어요

 

class Solution {
    public int[] solution(int n) {
        int length = n % 2 == 0 ? n/2 : n/2 + 1;
        int[] answer = new int[length];
        int index = 0;
        for(int i=0; i<=n; i++){
            if(i % 2 != 0){
                answer[index] = i;
                index++;
            }
        }
        return answer;
    }
}