leetcode

0 class Solution {

1 public:

2 bool canMakeArithmeticProgression(vector<int> &arr) {

3 int n = arr.size();

4 if (n <= 2) return true;

5 sort(arr.begin(), arr.end());

6 int delta = arr[1] - arr[0];

7 for (int i = 2; i < n; i++) {

8 if (arr[i] - arr[i - 1] != delta) return false;

9 }

10 return true;

11 }

12 };