LeetCode | 413. Arithmetic Slices

最新推荐文章于 2024-10-13 15:10:00 发布

1LOVESJohnny

最新推荐文章于 2024-10-13 15:10:00 发布

阅读量114

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/121067277

版权

leetcode 算法 C++

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

.

题目

An integer array 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, [1,3,5,7,9], [7,7,7,7], and [3,-1,-5,-9] are arithmetic sequences.
Given an integer array nums, return the number of arithmetic subarrays of nums.

A subarray is a contiguous subsequence of the array.

Example 1:

Input: nums = [1,2,3,4]
Output: 3
Explanation: We have 3 arithmetic slices in nums: [1, 2, 3], [2, 3, 4] and [1,2,3,4] itself.

Example 2:

Input: nums = [1]
Output: 0

Constraints:

1 <= nums.length <= 5000
-1000 <= nums[i] <= 1000

.

代码

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        if(A.size()<3)
			return 0;
		int num = 0;
		int *visit = new int[A.size()];
		memset(visit, 0, sizeof(int)*A.size());
		
		for(int start = 0, end = 2; start<A.size() && end<A.size(); start++){
			int diff = A[start]-A[start+1];
			for(int i = start+1; i<end; i++){
				if(A[i]-A[i+1] == diff){
					num ++;
					if(!visit[i+1] && end<A.size()-1){
						end ++;
						visit[i+1] = 1;
					}
				}
			}
			if(start == end - 2){
				end += 1;
			}
		}
		return num;
    }
};