-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patharithmetic_progression.js
More file actions
36 lines (32 loc) · 1.05 KB
/
arithmetic_progression.js
File metadata and controls
36 lines (32 loc) · 1.05 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/**
https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/
A sequence of numbers is called an arithmetic progression if the difference between any two consecutive elements is the same.
Given an array of numbers arr, return true if the array can be rearranged to form an arithmetic progression. Otherwise, return false.
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.
```
Constraints:
2 <= arr.length <= 1000
-106 <= arr[i] <= 106
**/
/**
* @param {number[]} arr
* @return {boolean}
*/
var canMakeArithmeticProgression = function(arr) {
arr.sort((a, b)=>a - b);
let diff = Math.abs(arr[0] - arr[1]);
for (let i = 0; i < arr.length - 1; ++i){
if (Math.abs(arr[i] - arr[i+1]) !== diff) return false;
}
return true;
};