413. Arithmetic Slices**
来源：互联网 发布：湖南有色行情分析软件 编辑：程序博客网 时间：2024/06/08 08:06
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: 3, for 3 arithmetic slices in A: [1, 2, 3], [2, 3, 4] and [1, 2, 3, 4] itself.
Reference
public int numberOfArithmeticSlices(int[] A) { int curr = 0, sum = 0; for (int i=2; i<A.length; i++) if (A[i]-A[i-1] == A[i-1]-A[i-2]) { curr += 1; sum += curr; } else { curr = 0; } return sum;}
总结：这道题理解的偏难了，注意题目中要求是连续的数字为等差序列，而不是可以隔开的那种，如：3,4,6,7,9,10,12
0 0
- 413. Arithmetic Slices
- [LeetCode]413.Arithmetic Slices
- Leetcode 413. Arithmetic Slices
- Leetcode-413. Arithmetic Slices
- 413. Arithmetic Slices
- 413. Arithmetic Slices
- 【LeetCode】413. Arithmetic Slices
- 413. Arithmetic Slices
- Leetcode-413. Arithmetic Slices
- 413. Arithmetic Slices
- 413. Arithmetic Slices
- 413. Arithmetic Slices
- 413. Arithmetic Slices
- LeetCode 413. Arithmetic Slices
- 413. Arithmetic Slices 【M】
- 413. Arithmetic Slices
- Leetcode 413. Arithmetic Slices
- 413. Arithmetic Slices
- jsp分页显示的代码与详细步骤
- ps-lite源码阅读笔记
- C语言作业
- Android数据存储几种方式用法总结
- H5 Clock
- 413. Arithmetic Slices**
- 有n个人围成一圈,顺序排号,从第一个开始报数(从1到m报数),凡报到m的人退出圈子,问最后最后留下的是原来第几号的那位
- JVM内存区域--堆栈方法区等概念理解
- recovery字库相关，如何修改字库文件
- org.hibernate.MappingException: Unknown entity:
- SDL_ShowCursor函数
- JSP---网上商城购物车
- Web作业
- CSS 图片不停旋转
