LV. 0 :: 짝수 홀수 개수

 

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

프로그래머스

function solution(num_list) {
    var zzak=0;
    var hol=0;
    
    for (i=0; i<num_list.length; i++)
    {
        if (num_list[i] % 2 ==0){zzak += 1;}
        else {hol += 1;} 
    }    
    return [zzak, hol];
}

+)230510

const solution = (num_list) => {
    return [num_list.filter(x=>x%2==0).length, num_list.filter(x=>x%2!=0).length];
}

230525 파이썬

def solution(num_list): 
    zzak = 0;
    hol = 0;
    for i in num_list:
        if i % 2 == 0:
            zzak += 1
        else:
            hol += 1
    return [zzak,hol]

230915 C++

#include <string>
#include <vector>

using namespace std;

vector<int> solution(vector<int> num_list) { 
    int even = 0; 
    int odd = 0;
    for (int i=0; i<num_list.size(); i++){
        if(num_list[i]%2==0) {even++;}
        else {odd++;}
    }
    return {even,odd};
}