[프로그래머스/Java] 소수 만들기

-Code

class Solution {
    public int solution(int[] nums) {
        int answer = 0;
        int len = nums.length;
        for (int i = 0; i < len - 2; i++) {
            for (int j = i + 1; j < len - 1; j++) {
                for (int k = j + 1; k < len; k++) {
                    if (primeNumber(nums[i] + nums[j] + nums[k])){
                        answer++;
                    }
                }
            }
        }

        return answer;
    }

    public static boolean primeNumber(int n) {
        for (int i = 2; i <= n / 2; i++) {
            if (n % i== 0) return false;
        }
        return true;
    }
}