leetcode

0 class Solution {

1 public:

2 vector<bool> checkArithmeticSubarrays(const vector<int> &nums, const vector<int> &l,

3 const vector<int> &r) {

4 int n = nums.size(), m = l.size();

5 vector<bool> res(m, true);

6 for (int q = 0; q < m; q++) {

7 if (r[q] - l[q] < 2) continue;

8 vector<int> range(nums.begin() + l[q], nums.begin() + r[q] + 1);

9 sort(range.begin(), range.end());

10 const int diff = range[1] - range[0];

11 for (int i = 2; i < range.size(); i++) {

12 if (range[i] - range[i - 1] != diff) {

13 res[q] = false;

14 break;

15 }

16 }

17 }

18 return res;

19 }

20 };