[Programmers] 삼총사 (Lv , Java)

[ 학습 내용 ]
중복되지 않는 순열

[ 소스 코드 ]

import java.util.*;
import java.util.stream.*;

class Solution {
    public int answer = 0;
    public int student[] = new int[3];
    
    public void trio(int idx, int cnt, int number[]) {
        if (idx > number.length) return;
        if (cnt == 3) {
            int sum = 0;
            for(int x : student) {
                sum += x;
            }
            if (sum == 0) answer++;
            return;
        }
        for(int i=idx; i<number.length; i++) {
            student[cnt] = number[i];
            trio(i+1, cnt+1, number);
        }
    }
    
    public int solution(int[] number) {
        trio(0, 0, number);   
        return answer;
    }
}