LeetCode1534. Count Good Triplets

最新推荐文章于 2024-09-27 14:28:55 发布

叶卡捷琳堡

最新推荐文章于 2024-09-27 14:28:55 发布

阅读量460

点赞数 9

文章标签：算法数据结构 c++ leetcode

本文链接：https://blog.csdn.net/weixin_46841376/article/details/135360983

版权

文章讨论了如何在一个整数数组中找到满足三个条件的三元组，即任意两个元素差的绝对值不大于给定的a、b、c。通过三层嵌套循环计算并返回符合条件的三元组总数。

摘要由CSDN通过智能技术生成

文章目录

- 一、题目
- 二、题解

一、题目

Given an array of integers arr, and three integers a, b and c. You need to find the number of good triplets.

A triplet (arr[i], arr[j], arr[k]) is good if the following conditions are true:

Return the number of good triplets.

Example 1:

Input: arr = [3,0,1,1,9,7], a = 7, b = 2, c = 3
Output: 4
Explanation: There are 4 good triplets: [(3,0,1), (3,0,1), (3,1,1), (0,1,1)].
Example 2:

Input: arr = [1,1,2,2,3], a = 0, b = 0, c = 1
Output: 0
Explanation: No triplet satisfies all conditions.

Constraints:

3 <= arr.length <= 100
0 <= arr[i] <= 1000
0 <= a, b, c <= 1000

二、题解

class Solution {
public:
    int countGoodTriplets(vector<int>& arr, int a, int b, int c) {
        int res = 0;
        int n = arr.size();
        for(int i = 0;i < n;i++){
            for(int j = i + 1;j < n;j++){
                bool fa = false;
                if(abs(arr[i] - arr[j]) <= a) fa = true;
                for(int k = j + 1;k < n;k++){
                    bool fb = false,fc = false;
                    if(abs(arr[j] - arr[k]) <= b) fb = true;
                    if(abs(arr[i] - arr[k]) <= c) fc = true;
                    if(fa && fb && fc) res++;
                }
            }
        }
        return res;
    }
};