1534. 统计好三元组

class Solution {
public:
    int countGoodTriplets(vector<int>& arr, int a, int b, int c) 
    {
        int ans = 0, n = arr.size();
        for (int j = 1; j < n; j++) 
        {
            for (int k = j + 1; k < n; k++) 
            {
                if (abs(arr[j] - arr[k]) <= b) 
                {
                    int lj = arr[j] - a, rj = arr[j] + a;
                    int lk = arr[k] - c, rk = arr[k] + c;
                    int l = max(lj, lk), r = min(rj, rk);
                    if (l <= r) 
                    {
                        for(int i = 0; i < j; i++)
                        {
                            if(arr[i] >= l && arr[i] <= r)
                                ans++;
                        }
                    }
                }
            }
        }
        return ans;
    }
};