Number of Arithmetic Triplets
You are given a 0-indexed, strictly increasing integer array nums and a positive integer diff. A triplet (i, j, k) is an arithmetic triplet if the following conditions are met:
i < j < k,nums[j] - nums[i] == diff, andnums[k] - nums[j] == diff.
Return the number of unique arithmetic triplets.
Example 1
Input
nums = [0,1,4,6,7,10], diff = 3Output
2(1, 2, 4) and (2, 4, 5) are arithmetic triplets because their consecutive values differ by 3.
Example 2
Input
nums = [4,5,6,7,8,9], diff = 2Output
2(0, 2, 4) and (1, 3, 5) are arithmetic triplets because their consecutive values differ by 2.
Constraints
- 3 <= nums.length <= 200
- 0 <= nums[i] <= 200
- 1 <= diff <= 50
- nums is strictly increasing.