美文网首页
446. Arithmetic Slices II - Subs

446. Arithmetic Slices II - Subs

作者: matrxyz | 来源:发表于2018-01-16 06:57 被阅读0次

    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.

    Solution:

    思路:
    http://www.cnblogs.com/grandyang/p/6057934.html

    Time Complexity: O(N) Space Complexity: O(N)

    Solution Code:

    
    

    相关文章

      网友评论

          本文标题:446. Arithmetic Slices II - Subs

          本文链接:https://www.haomeiwen.com/subject/zpbjoxtx.html