2367.算术三元组的数目
思路:方法一,三层for循环来枚举。
class Solution {
public:
int arithmeticTriplets(vector<int>& nums, int diff) {
int n=nums.size();
if(n<3) return 0;
int ct=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
for(int k=j+1;k<n;k++){
if(nums[j]-nums[i]==diff &&nums[k]-nums[j]==diff) ct++;
}
}
}
return ct;
}
};
思路:方法二,用一层for循环来预处理出当前位置i,前面有多少值为nums[i]-diff的元素。同理,找到后面有多少值为nums[i]+diff的元素。用哈希表来记录,然后两个值相乘,答案就出来了
class Solution {
public:
int arithmeticTriplets(vector<int>& nums, int diff) {
int n=nums.size();
if(n<3) return 0;
unordered_map<int ,int> mp1,mp2;
vector<int> v1(n,0),v2(n,0);
for(int i=0;i<n;i++){
if(mp1.find(nums[i]-diff)!=mp1.end()){
v1[i]=mp1[nums[i]-diff];
}
mp1[nums[i]]++;
}
for(int i=n-1;i>=0;i--){
if(mp2.find(nums[i]+diff)!=mp2.end()){
v2[i]=mp2[nums[i]+diff];
}
mp2[nums[i]]++;
//cout<<v1[i]<<" "<<v2[i]<<endl;
}
int ct=0;
for(int i=1;i<n-1;i++){
ct+=v1[i]*v2[i];
}
return ct;
}
};