解题思路:
(1)截取子数组,排序
class Solution {
public:
bool Judge(vector<int> &v) {
int d=v[1]-v[0];
for(int i=0;i<v.size()-1;i++) {
if(v[i+1]-v[i]!=d) return false;
}
return true;
}
vector<bool> checkArithmeticSubarrays(vector<int>& nums, vector<int>& l, vector<int>& r) {
vector<bool> vec;
vector<int> v;
for(int i=0;i<l.size();i++) {
v.clear();
for(int j=l[i];j<=r[i];j++) {
v.push_back(nums[j]);
}
sort(v.begin(),v.end());
vec.push_back(Judge(v));
}
return vec;
}
};