前言
经过前期的基础训练以及部分实战练习,粗略掌握了各种题型的解题思路。后续开始专项练习。
描述
给你一个下标从 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
严格 递增
实现原理与步骤
1.按题干要求,逐次遍历3个索引值并计算是否符合对应条件。
2.考虑单层循环加双指针优化。
代码实现(单循环双指针枚举)
class Solution {
public int arithmeticTriplets(int[] nums, int diff) {
int res = 0;
for (int i = 1; i < nums.length - 1; i++) {
int left = i - 1;
int right = i + 1;
boolean flag = false;
while (left >= 0) {
if (nums[i] - nums[left--] == diff) {
flag = true;
break;
}
}
if (flag) {
while (right < nums.length) {
if (nums[right++] - nums[i] == diff) {
res++;
break;
}
}
}
}
return res;
}
}