LeetCode-algorithms 413. Arithmetic Slices

题目:

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.


思路:

这一题由于检索的是连续的数字所组成的数组,因此所有连续的子数组都有可能组成这种连续的等差数列,因此使用DP的方法去处理是最好的。

这里的DP[i][j]为从第i个数到第j个数是否等差数组,而dp[i][j+1]则只需要判断dp[i][j]是否等差数组,并且dp[i][j]-dp[i][j-1]是否等于dp[i][j+1]-dp[i][j]即可。初始化dp[i][i+1]为True。最后记录遍历中所检索到所有的等差数组即可。


代码:

class Solution {
public:
	int numberOfArithmeticSlices(vector<int>& A) {
		int result = 0;
		int size = A.size();
		vector<vector<bool>> dp(size, vector< bool>(size));
		for (int i = 0; i < size - 1; i++){
			dp[i][i + 1] = true;
		}
		for (int step = 2; step < size; step++){
			for (int i = 0; i < size - step; i++){
				if (!dp[i][i + step-1]){
					dp[i][i + step] = false;
					continue;
				}
				if (A[i + step] - A[i + step - 1] == A[i + step - 1] - A[i + step - 2]){
					dp[i][i + step] = true;
					result += 1;
				}
				else{
					dp[i][i + step] = false;
				}
			}
		}
		return result;
	}
};

结果:

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值