Leetcode 413 & 446

Leetcode 413 & 446

Leetcode 413 Arithmetic Slices

Description

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.

题解

这道题较简单，就用一个循环从头到尾判断是否满足num[i - 1] - num[i - 2] = num[i] - num[i - 1]，如果满足则存在的等差数列在上一个的记录的基础上加1，然后总和再加上这个数值。如果遇到一个不满足上面等式的则等差数列中断，数值重置为0。代码如下:

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        int sum = 0, dp = 0;
        for (int i = 2; i < A.size(); i++) {
            if (A[i] - A[i - 1] == A[i - 1] - A[i - 2]) {
                dp++;
                sum += dp;
            } else {
                dp = 0;
            }
        }
        return sum;
    }
};

Leetcode 446 Arithmetic Slices II - Subsequence

description

A sequence of numbers 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 sequences:

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 subsequence slice of that array is any sequence of integers (P0, P1, …, Pk) such that 0 ≤ P0 < P1 < … < Pk < N.
A subsequence slice (P0, P1, …, Pk) of array A is called arithmetic if the sequence A[P0], A[P1], …, A[Pk-1], A[Pk] is arithmetic. In particular, this means that k ≥ 2.
The function should return the number of arithmetic subsequence slices in the array A.
The input contains N integers. Every integer is in the range of -231 and 231-1 and 0 ≤ N ≤ 1000. The output is guaranteed to be less than 231-1.

Example:
Input: [2, 4, 6, 8, 10]
Output: 7
Explanation:
All arithmetic subsequence slices are:
[2,4,6]
[4,6,8]
[6,8,10]
[2,4,6,8]
[4,6,8,10]
[2,4,6,8,10]
[2,6,10]

题解

这道题和上一道的不同之处在于这道是等差子序列，即只要满足元素的位置是前后就足够了不一定要连续。则对每个元素i，用一个map来储存所有包含它的等差子序列并且记录每个差值，最后输出总结果。代码如下:

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        if (A.size() == 0)
            return 0;
        int res = 0;
        vector<map<int, int>> vec(A.size());
        for (int i = 0; i < A.size(); i++) {
            for (int j = 0; j < i; j++) {
                int diff = A[i] - A[j];
                if ((long)A[i] - (long)A[j] >= INT_MAX || (long)A[i] - (long)A[j] <= INT_MIN) continue;
                //表示以i为结尾，diff差的组合加1
                vec[i][diff] += 1;
                //不等于0表明存在这个差的子序列
                if (vec[j][diff] != 0) {
                    vec[i][diff] += vec[j][diff];
                    res += vec[j][diff];
                }
            }
        }
        return res;
    }
};