[Algorithm] 짝수 홀수 개수

Mission.

작성한 답

function solution(num_list) {
    let evenCount = 0;
    let oddCount = 0;
    for (let i = 0; i < num_list.length; i++) {
        if (num_list[i] % 2 === 0) {
            evenCount++;
        } else {
            oddCount++;
        }
    }
    return [evenCount, oddCount];
}

참고 자료

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