LeetCode 413. Arithmetic Slices 题解（C++）

LeetCode 413. Arithmetic Slices 题解（C++）

---

题目描述

• 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.

举例

• 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.

思路

第一种思路

• 使用两个for循环，外循环和内循环都从第一个元素遍历倒数第三个元素，外循环表示第i个元素为等差数列的首元素，内循环的j表示从外循环的第i个元素开始，到第j个元素结束的等差数列，若符合等差数列的要求，则每次result自加1，若不符合要求，则退出内循环；
• 这种算法的时间复杂度为O（n^2）。

第二种思路

• 这里先举个例子，若数组为[1, 2, 3]，则result=1；
  若数组为[1, 2, 3, 4]，等差数列包括了[1, 2, 3, 4]自身和[1, 2, 3]，[2, 3, 4]，result=1+2;
  若数组为[1, 2, 3, 4, 5]，等差数列包括了[1, 2, 3]，[2, 3, 4]，[3, 4, 5]，[1, 2, 3, 4]，[2, 3, 4, 4]和自身，result=1+2+3;
  由此我们可以得到规律，若是由N个数的等差数列组成的数组，则result=1+2+…+（N-2）。
• 由上面的例子，我们可以设置一个变量addLen，用来记录某一次我们加到result的数量，这里的每次循环若符合等差性质，则addLen自加1，并把结果加到result即可；若当前循环不符合等差性质，则addLen恢复成0，继续寻找下一个等差数列；
• 这种算法只需要遍历一次数组，时间复杂度为O（n）。

代码

思路一代码

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

思路二代码

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

        return result;
    }
};