https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/description/
给你一个阵列判断他有没有办法透过重新排列组成一个所有数字相差的值都一样的序列。
Example 1:
Input: arr = [3,5,1]
Output: true
Explanation: We can reorder the elements as [1,3,5] or [5,3,1] with
differences 2 and -2 respectively, between each consecutive elements.
Example 2:
Input: arr = [1,2,4]
Output: false
Explanation: There is no way to reorder the elements to obtain an arithmetic
progression.
思路：
1.排序之后两个两个检查是不是都一样就好==
Java Code：