LeetCode 413
来源:互联网 发布:快走丝hl编程忘了 编辑:程序博客网 时间:2024/06/05 22:51
LeetCode 413
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, 97, 7, 7, 73, -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: 3for 3 arithmetic slices in A: [1, 2, 3], [2, 3, 4] and [1, 2, 3, 4] itself.
solution:
分析题意,是寻找可以构成的递增数列数量。
考虑如下情况:
加入给定序列为123456
当遍历至3时,有一个递增数列。遍历至4时,新增两个递增数列。…遍历至6时,新增四个递增数列。
class Solution {public: int numberOfArithmeticSlices(vector<int>& A) { int n = A.size(); if(n < 3) return 0; vector<int> tempNum(n, 0); if(A[2]-A[1] == A[1]-A[0]) tempNum[2] = 1; int res = tempNum[2]; for (int i = 3; i < n; i++) { if(A[i]-A[i-1] == A[i-1]-A[i-2]) tempNum[i] = tempNum[i-1] + 1; res += tempNum[i]; } return res; }};
- leetcode 413
- LeetCode 413
- LeetCode #413: Arithmetic Slices
- LeetCode【413】Arithmetic Slices
- Leetcode 413 & 446
- leetcode 413 Arithmetic Slices
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- Springboot JavaMailSender发送邮件(QQ和163)
- 为什么未初始化的指针会指向一个不确定地址
- 面试记录第十六节——(UI卡顿的问题)
- 毕向东讲解(摘)—10.多线程(死锁)
- network的namespace中查询ip
- LeetCode 413
- Junit测试
- iOS一行shell脚本自动打包上传指定位置
- 如何从Red Hat官网下载镜像image:Atomic、OpenShift、Docker、Satellite、System Images runc
- maven打包生成可执行jar文件
- Batch Normalization
- git 本地项目上传
- 落单的数
- 【JZOJ 5405】【NOIP2017提高A组模拟10.10】Permutation