feat: add js solution to lc problem: No.1502.Can Make Arithmetic Progression From Sequence (#400)

Author: zhaocchen

Diff for: solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/README.md

@@ -76,6 +76,22 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} arr
+ * @return {boolean}
+ */
+var canMakeArithmeticProgression = function(arr) {
+    arr.sort((a, b) => a - b);
+    for (let i = 1; i < arr.length - 1; i++) {
+        if ((arr[i] << 1) != (arr[i - 1] + arr[i + 1])) return false;
+    }
+    return true;
+};
+```
+
 ### **...**
 
 ```

Diff for: solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/README_EN.md

@@ -66,6 +66,22 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} arr
+ * @return {boolean}
+ */
+var canMakeArithmeticProgression = function(arr) {
+    arr.sort((a, b) => a - b);
+    for (let i = 1; i < arr.length - 1; i++) {
+        if ((arr[i] << 1) != (arr[i - 1] + arr[i + 1])) return false;
+    }
+    return true;
+};
+```
+
 ### **...**
 
 ```

Diff for: solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/Solution.js

@@ -0,0 +1,11 @@
+/**
+ * @param {number[]} arr
+ * @return {boolean}
+ */
+ var canMakeArithmeticProgression = function(arr) {
+    arr.sort((a, b) => a - b);
+    for (let i = 1; i < arr.length - 1; i++) {
+        if ((arr[i] << 1) != (arr[i - 1] + arr[i + 1])) return false;
+    }
+    return true;
+};