2475_NumberofUnequalTripletsinArray - a920604a/leetcode GitHub Wiki

class Solution {
public:
    int unequalTriplets(vector<int>& nums) {
        
        // 2 3 4 4 4
        sort(nums.begin(), nums.end());
        int n = nums.size();
        if(n<3) return 1;
        int count =0;
        for(int i=0;i<n-2;i++){
            for(int j=i+1;j<n-1;++j){
                for(int k = j+1;k<n;++k){
                    if(nums[i]!=nums[j] && nums[j]!=nums[k]) count++;
                }
            }
        }
        return count;
        
    }
};