算数三元组的数目
给你一个下标从 0 开始、严格递增 的整数数组 nums
和一个正整数 diff
。如果满足下述全部条件,则三元组 (i, j, k)
就是一个 算术三元组 :
i < j < k
,nums[j] - nums[i] == diff
且nums[k] - nums[j] == diff
返回不同 算术三元组 的数目_。_
示例 1:
输入:nums = [0,1,4,6,7,10], diff = 3输出:2解释: (1, 2, 4) 是算术三元组:7 - 4 == 3 且 4 - 1 == 3 。(2, 4, 5) 是算术三元组:10 - 7 == 3 且 7 - 4 == 3 。
示例 2:
输入:nums = [4,5,6,7,8,9], diff = 2输出:2解释:(0, 2, 4) 是算术三元组:8 - 6 == 2 且 6 - 4 == 2 。(1, 3, 5) 是算术三元组:9 - 7 == 2 且 7 - 5 == 2 。
提示:
3 <= nums.length <= 200
0 <= nums[i] <= 200
1 <= diff <= 50
nums
严格 递增
本题可以使用循环和判断语句结合的方法求解
代码如下
class Solution {
public int arithmeticTriplets(int[] nums, int diff) {//定义一个严格递增的整数数组和一个正整数diff
int num = 0;//定义算数三元组的数目num并初始化为0
for(int k = 2;k < nums.length;k++){//因为下标从0开始 并且i<j<k,所以我们可以让k初始化为2,令其小于整数数组的长度并进行循环
for(int j = 1;j<k;j++){//同理 令j初始化为1
for(int i = 0;i < k;i++){//同理
//判断题中给的条件是否满足
if (nums[j] - nums[i] == diff && nums[k] - nums[j] == diff){
//满足则为算术三元组,num加1
num++;
}
}
}
}
//最后返回num的值 即为算术三元组的数目
return num;
}
}