[알고리즘문제풀기] 짝수 홀수 개수

문제

내가 작성한 정답

class Solution {
    public int[] solution(int[] num_list) {
        int a= 0, b=0;
        for(int i: num_list){
            if(i%2==0) a++;
            else b++;
        }
        return new int[]{a,b};
    }
}

다른 사람들의 정답

class Solution {
    public int[] solution(int[] num_list) {
        int[] answer = new int[2];

        for(int i = 0; i < num_list.length; i++)
            answer[num_list[i] % 2]++;

        return answer;
    }
}


import java.util.stream.IntStream;
import java.util.Arrays;

class Solution {
    public int[] solution(int[] numList) {
        return IntStream.of((int) Arrays.stream(numList).filter(i -> i % 2 == 0).count(), (int) Arrays.stream(numList).filter(i -> i % 2 == 1).count()).toArray();
    }
}