Leetcode 413. Arithmetic Slices[medium]

题目：
A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.

For example, these are arithmetic sequence:

1, 3, 5, 7, 9
7, 7, 7, 7
3, -1, -5, -9
The following sequence is not arithmetic.

1, 1, 2, 5, 7

A zero-indexed array A consisting of N numbers is given. A slice of that array is any pair of integers (P, Q) such that 0 <= P < Q < N.

A slice (P, Q) of array A is called arithmetic if the sequence:
A[P], A[p + 1], …, A[Q - 1], A[Q] is arithmetic. In particular, this means that P + 1 < Q.

The function should return the number of arithmetic slices in the array A.

Example:

A = [1, 2, 3, 4]

return: 3, for 3 arithmetic slices in A: [1, 2, 3], [2, 3, 4] and [1, 2, 3, 4] itself.

---

分类math。
不得不说又是混题数的。
就是n个数的等差数列算一算有多少个等差片段。。。

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        int ans = 0;
        int ad = 0;
        int cs = 0;
        for (int i = 1; i < A.size(); i++) {
            int cd = A[i] - A[i - 1];
            if (cd == cs) ad++;
            else {
                if (ad >= 2) {
                    int tn = ad + 1 - 3 + 1;
                    ans += (tn + 1) * tn / 2;
                }
                ad = 1;
                cs = cd;
            }
        }
        if (ad >= 2) {
            int tn = ad + 1 - 3 + 1;
            ans += (tn + 1) * tn / 2;
        }
        return ans;
    }
};