Arithmetic Slices LT413

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.

Idea 1. How to extend the solution from A[i...j] to A[i...j+1]?  dynamic programming的应用解法，试着想如果A[i..j]是arithmetic sequence，dp[j]是以A[j]结尾的arithmetic sequence的个数，那么

　　dp[j+1] = dp[j] + 1 if A[j+1] - A[j] = A[j] - A[j-1]; 

　　dp[j+1] = 0 otherwise;

[1, 2, 3, 4, 5], 以3结尾的arithmetic sequence(1, 2, 3)是 1，

　　　　　 以4结尾的 arithmetic sequence有(2, 3, 4), (1, 2, 3, 4)

                以5结尾的 arithmetic sequence有(3, 4, 5), (2, 3, 4, 5), (1, 2, 3, 4, 5)

 class Solution {
     public int numberOfArithmeticSlices(int[] A) {
        int count = 0;
        int curr = 0;
        for(int i = 2; i < A.length; ++i) {
            if(A[i-1] - A[i-2] == A[i] - A[i-1]) {
                ++curr;
                count += curr;
            }
            else {
                curr = 0;
            }
        }
         return count;
     }
 }

python:

 class Solution:
     def numberOfArithmeticSlices(self, A: List[int]) -> int:
         curr: int = 0
         count: int = 0

         for i in range(2, len(A)):
             if A[i-1] - A[i-2] == A[i] - A[i-1]:
                 curr += 1
                 count += curr
             else:
                 curr = 0

         return count

Idea 2. Instead of updating the accumulated sum for each consecutive sequence, only updating the sum once the longest sequence so far is found. 根据公式 curr * (curr+1)/2来计算现在这一段的arithmetic sequence的个数.

[1, 2, 3, 4, 5], 以3结尾的arithmetic sequence个数是 1，(1, 2, 3)

　　　　　 以4结尾的 arithmetic sequence个数是 2，有(2, 3, 4), (1, 2, 3, 4)

                以5结尾的 arithmetic sequence个数是 3，有(3, 4, 5), (2, 3, 4, 5), (1, 2, 3, 4, 5)

总个数 1 + 2 + 3 = (1+3)*3/2 = 6

 class Solution {
     public int numberOfArithmeticSlices(int[] A) {
        int count = 0;
        int curr = 0;
        for(int i = 2; i < A.length; ++i) {
            if(A[i-1] - A[i-2] == A[i] - A[i-1]) {
                ++curr;
            }
            else {
                count += curr * (curr + 1)/2;
                curr = 0;
            }
        }

         count += curr * (curr + 1)/2;
         return count;
     }
 }

python:

 class Solution:
     def numberOfArithmeticSlices(self, A: List[int]) -> int:
         curr: int = 0
         count: int = 0

         for i in range(2, len(A)):
             if A[i-1] - A[i-2] == A[i] - A[i-1]:
                 curr += 1
             else:
                 count += curr * (curr + 1)/2
                 curr = 0

         count += curr * (curr + 1)/2
         return int(count)