[프로그래머스] 삼총사(Kotlin)

[프로그래머스] 삼총사(Kotlin)

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

풀이

class Solution {
    fun solution(number: IntArray): Int {
        var answer: Int = 0
        
        val indexSet = hashSetOf<IntArray>()
        for(i in 0 until number.size){
            for(j in i + 1 until number.size){
                for(k in j + 1 until number.size){
                    if(number[i] + number[j] + number[k] == 0){
                        val curIndex = intArrayOf(i, j, k)
                        if(indexSet.contains(curIndex)) continue
                        else{
                            answer++
                            indexSet.add(curIndex)
                        }
                    }
                }
            }
        }
        return answer
    }
}