zoukankan      html  css  js  c++  java
  • 【leetcode】1534. Count Good Triplets

    题目如下:

    Given an array of integers arr, and three integers ab 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:

    • 0 <= i < j < k < arr.length
    • |arr[i] - arr[j]| <= a
    • |arr[j] - arr[k]| <= b
    • |arr[i] - arr[k]| <= c

    Where |x| denotes the absolute value of x.

    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

    解题思路:直接一个三层的for循环搞定。

    代码如下:

    class Solution(object):
        def countGoodTriplets(self, arr, a, b, c):
            """
            :type arr: List[int]
            :type a: int
            :type b: int
            :type c: int
            :rtype: int
            """
            res = 0
            for i in range(len(arr)):
                for j in range(i+1,len(arr)):
                    for k in range(j+1,len(arr)):
                        if abs(arr[i] - arr[j]) <= a and 
                                abs(arr[j] - arr[k]) <= b and
                                abs(arr[i] - arr[k]) <= c:
                            res += 1
            return res
  • 相关阅读:
    CSU1018: Avatar
    ZOJ
    HDU—4463 Outlets 最小生成树
    查询文件中值所在的路径
    mysql语句查询时间检测
    phpmyadmin修改root密码
    检测Linux glibc幽灵漏洞和修补漏洞
    监控宝安装手册
    ubuntu安装环境软件全文档
    ubuntu mysql主从库的搭建
  • 原文地址:https://www.cnblogs.com/seyjs/p/13667265.html
Copyright © 2011-2022 走看看