[Programmers] Lv.0 | 짝수 홀수 개수 | Java

문제

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

 

풀이

class Solution {
    public int[] solution(int[] num_list) {
        int[] result = new int[2];
        
        for (int num : num_list) {
            if (num % 2 == 0) {
                result[0]++;
            } else {
                result[1]++;
            }
        }
        
        return result;
    }
}

class Solution {
    public int[] solution(int[] num_list) {
        int[] result = new int[2];
        
        for (int i = 0; i < num_list; i++) {
        	answer[num_list[i] % 2]++;
        }
        
        return result;
    }
}