LeetCode --- 1534. Count Good Triplets 解题报告

Posted 杨鑫newlfe

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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 

以上是关于LeetCode --- 1534. Count Good Triplets 解题报告的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode Algorithm 1534. 统计好三元组

51nod 1534 棋子游戏

HDOJ1534差分约束+SPFA

51nod-1534-博弈

LeetCode Count Univalue Subtrees

Leetcode 之Count and Say(35)