题目地址:
https://leetcode.com/problems/arithmetic-slices-ii-subsequence/
给定一个长 n n n数组 A A A,求 A A A中长度不少于 3 3 3的等差子序列的个数。
设 f [ i ] [ d ] f[i][d] f[i][d]为以 A [ i ] A[i] A[i]结尾,公差为 d d d的等差子序列的个数,长度允许等于 2 2 2。那么我们可以枚举等差子序列的最后两个数,当枚举到 j , i , j < i j,i, j<i j,i,j<i的时候,考虑 f [ i ] [ d ] f[i][d] f[i][d],这种子序列的个数包括了 ( A [ j ] , A [ i ] ) (A[j],A[i]) (A[j],A[i])这一个子序列,也包括了前面接上 f [ j ] [ d ] f[j][d] f[j][d]的子序列,从而我们要将 f [ j ] [ d ] + 1 f[j][d]+1 f[j][d]+1累加到 f [ i ] [ d ] f[i][d] f[i][d]上。统计答案的时候只需要将长度为 2 2 2的等差子序列删掉即可。代码如下:
class Solution {
public:
int numberOfArithmeticSlices(vector<int>& a) {
int n = a.size(), res = 0;
vector<unordered_map<long, int>> cnt(n);
for (int i = 0; i < n; i++)
for (int j = 0; j < i; j++) {
long diff = (long)a[i] - a[j];
int s = 0;
if (cnt[j].count(diff)) s = cnt[j][diff];
cnt[i][diff] += s + 1;
res += s;
}
return res;
}
};
时空复杂度 O ( n 2 ) O(n^2) O(n2)。