[Swift 알고리즘] 소수 만들기

https://programmers.co.kr/learn/courses/30/lessons/12977

import Foundation

func solution(_ nums:[Int]) -> Int {
    var answer = 0
    
    func isPrime(_ n:Int) -> Bool {
        for i in 2..<n {
            if n % i == 0 {
                return false
            }
        }
        return true
    }

    for i in 0..<nums.count - 2 {
        for j in i + 1..<nums.count - 1 {
            for k in j + 1..<nums.count {
                let addNums = nums[i] + nums[j] + nums[k]
                if isPrime(addNums) {
                    answer += 1
                }
                
            }
        }
    }
    
    return answer
}