class Solution {
public:
bool canMakeArithmeticProgression(vector<int>& arr) {
sort(arr.begin(), arr.end());
for(int i = 0; i < arr.size() - 1; i++)
{
if(arr[i + 1] - arr[i] != arr[1] - arr[0])
{
return false;
}
}
return true;
}
};
leetcode 1502. 判断能否形成等差数列
猜你喜欢
转载自blog.csdn.net/weixin_43956456/article/details/107634500
今日推荐
周排行