Leetcode 1630. Arithmetic Subarrays

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

**解析：**Version 1，根据左右索引，对数组切片，然后排序，判断其是否是算术(等差)子数组。

• Version 1

class Solution:def checkArithmeticSubarrays(self, nums: List[int], l: List[int], r: List[int]) -> List[bool]:m = len(l)result = []for i in range(m):left = l[i]right = r[i]temp = nums[left:right+1]temp.sort()flag = Truefor j in range(2, len(temp)):if temp[j] - temp[j-1] != temp[j-1] - temp[j-2]:flag = Falsebreakresult.append(flag)return result

Reference

1. https://leetcode.com/problems/arithmetic-subarrays/