LeetCode_1534_统计好三元组

题目链接

• https://leetcode-cn.com/problems/count-good-triplets/

解题思路

• 直接暴力枚举

AC代码

class Solution {
    public int countGoodTriplets(int[] arr, int a, int b, int c) {
        int ans = 0;
        for (int i = 0; i < arr.length; i++) {
            for (int j = i + 1; j < arr.length; j++) {
                for (int k = j + 1; k < arr.length; k++) {
                    boolean x = Math.abs(arr[i] - arr[j]) <= a;
                    boolean y = Math.abs(arr[j] - arr[k]) <= b;
                    boolean z = Math.abs(arr[i] - arr[k]) <= c;
                    if (x && y && z)
                        ans++;
                }
            }
        }
        return ans;
    }
}

本地测试代码

package com.company;

public class Solution_1002 {
    public static int countGoodTriplets(int[] arr, int a, int b, int c) {
        int ans = 0;
        for (int i = 0; i < arr.length; i++) {
            for (int j = i + 1; j < arr.length; j++) {
                for (int k = j + 1; k < arr.length; k++) {
                    boolean x = Math.abs(arr[i] - arr[j]) <= a;
                    boolean y = Math.abs(arr[j] - arr[k]) <= b;
                    boolean z = Math.abs(arr[i] - arr[k]) <= c;
                    if (x && y && z)
                        ans++;
                }
            }
        }
        return ans;
    }

    public static void main(String[] args) {
        System.out.println(countGoodTriplets(new int[]{3, 0, 1, 1, 9, 7}, 7, 2, 3));
        System.out.println(countGoodTriplets(new int[]{1, 1, 2, 2, 3}, 0, 0, 1));
    }
}