413. Arithmetic Slices(LeetCode)
Posted 无惧风云
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了413. Arithmetic Slices(LeetCode)相关的知识,希望对你有一定的参考价值。
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.
1 class Solution { 2 public: 3 int numberOfArithmeticSlices(vector<int>& A) { 4 int len = A.size(); 5 if (len < 3) 6 return 0; 7 vector<int> vet; 8 vector<int> vet1; 9 int count = 0; 10 for (int i = 0; i < len-1; i++) 11 { 12 vet.push_back(A[i + 1] - A[i]); 13 } 14 int temp = vet[0]; 15 for (int i = 0; i < vet.size()-1; i++) 16 { 17 if (temp== vet[i + 1]) 18 count++; 19 else 20 { 21 vet1.push_back(count+1); 22 count = 0; 23 temp = vet[i + 1]; 24 } 25 } 26 vet1.push_back(count+1); 27 int sum = 0; 28 for(int i=0;i<vet1.size();i++) 29 { 30 sum += vet1[i]*(vet1[i] - 1) / 2; 31 } 32 return sum; 33 } 34 };
以上是关于413. Arithmetic Slices(LeetCode)的主要内容,如果未能解决你的问题,请参考以下文章
[LeetCode]413 Arithmetic Slices
[leetcode-413-Arithmetic Slices]
413. Arithmetic Slices(LeetCode)
Leetcode413. Arithmetic Slices