LeetCode - The World's Leading Online Programming Learning Platform
class Solution {
public boolean canMakeArithmeticProgression(int[] arr) {
Arrays.sort(arr);
int n = arr[0] - arr[1] ;
for (int i = 1; i < arr.length -1 ; i++)
{
if ((arr[i] - arr[i+1]) != n ){
return false;
}
}
return true;
}
}