LeetCode413. Arithmetic Slices

题目：

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.

分析：

从原数组A中得到数组B，B[i] = A[i+1] - A[i]。数组B保存了相邻两项的差值，在差值数组中找到相同数字的片段。若片段的长度为n，那么从这个片段可以得到的长度为3 的arithmetic slices的数量为n-1，长度为4的为n-2... ... 长度为n+1的为1。总的数量为等差数列的和n*(n-1) / 2 (n>=2)。

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

>.<