feat: add solutions to lc problem: No.1502

No.1502.Can Make Arithmetic Progression From Sequence

Author: yanglbme

solution/1400-1499/1496.Path Crossing/README.md

@@ -47,7 +47,7 @@
 
 **方法一：哈希表**
 
-我们可以用一个哈希表 $vis$ 记录路径上的点。初始时，$vis$ 中只有原点 $(0, 0)$。
+我们可以用一个哈希表 $vis$ 记录路径上的点。初始时 $vis$ 中只有原点 $(0, 0)$。
 
 遍历字符串 $path$，对于每个字符 $c$，根据 $c$ 的值更新当前位置 $(i, j)$，然后判断 $(i, j)$ 是否在 $vis$ 中，如果在，则返回 `true`，否则将 $(i, j)$ 加入 $vis$ 中。
 

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

@@ -41,6 +41,12 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：排序 + 遍历**
+
+我们可以先将数组 `arr` 排序，然后遍历数组，判断相邻两项的差是否相等即可。
+
+时间复杂度 $O(n \times \log n)$，空间复杂度 $O(\log n)$。其中 $n$ 为数组 `arr` 的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -51,10 +57,8 @@
 class Solution:
     def canMakeArithmeticProgression(self, arr: List[int]) -> bool:
         arr.sort()
-        for i in range(1, len(arr) - 1):
-            if (arr[i] << 1) != arr[i - 1] + arr[i + 1]:
-                return False
-        return True
+        d = arr[1] - arr[0]
+        return all(b - a == d for a, b in pairwise(arr))
 ```
 
 ### **Java**
@@ -65,13 +69,47 @@ class Solution:
 class Solution {
     public boolean canMakeArithmeticProgression(int[] arr) {
         Arrays.sort(arr);
-        for (int i = 1; i < arr.length - 1; ++i) {
-            if ((arr[i] << 1) != arr[i - 1] + arr[i + 1]) {
+        int d = arr[1] - arr[0];
+        for (int i = 2; i < arr.length; ++i) {
+            if (arr[i] - arr[i - 1] != d) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool canMakeArithmeticProgression(vector<int>& arr) {
+        sort(arr.begin(), arr.end());
+        int d = arr[1] - arr[0];
+        for (int i = 2; i < arr.size(); i++) {
+            if (arr[i] - arr[i - 1] != d) {
                 return false;
             }
         }
         return true;
     }
+};
+```
+
+### **Go**
+
+```go
+func canMakeArithmeticProgression(arr []int) bool {
+	sort.Ints(arr)
+	d := arr[1] - arr[0]
+	for i := 2; i < len(arr); i++ {
+		if arr[i]-arr[i-1] != d {
+			return false
+		}
+	}
+	return true
 }
 ```
 

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

@@ -43,10 +43,8 @@
 class Solution:
     def canMakeArithmeticProgression(self, arr: List[int]) -> bool:
         arr.sort()
-        for i in range(1, len(arr) - 1):
-            if (arr[i] << 1) != arr[i - 1] + arr[i + 1]:
-                return False
-        return True
+        d = arr[1] - arr[0]
+        return all(b - a == d for a, b in pairwise(arr))
 ```
 
 ### **Java**
@@ -55,8 +53,9 @@ class Solution:
 class Solution {
     public boolean canMakeArithmeticProgression(int[] arr) {
         Arrays.sort(arr);
-        for (int i = 1; i < arr.length - 1; ++i) {
-            if ((arr[i] << 1) != arr[i - 1] + arr[i + 1]) {
+        int d = arr[1] - arr[0];
+        for (int i = 2; i < arr.length; ++i) {
+            if (arr[i] - arr[i - 1] != d) {
                 return false;
             }
         }
@@ -65,6 +64,39 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool canMakeArithmeticProgression(vector<int>& arr) {
+        sort(arr.begin(), arr.end());
+        int d = arr[1] - arr[0];
+        for (int i = 2; i < arr.size(); i++) {
+            if (arr[i] - arr[i - 1] != d) {
+                return false;
+            }
+        }
+        return true;
+    }
+};
+```
+
+### **Go**
+
+```go
+func canMakeArithmeticProgression(arr []int) bool {
+	sort.Ints(arr)
+	d := arr[1] - arr[0]
+	for i := 2; i < len(arr); i++ {
+		if arr[i]-arr[i-1] != d {
+			return false
+		}
+	}
+	return true
+}
+```
+
 ### **JavaScript**
 
 ```js

solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/Solution.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    bool canMakeArithmeticProgression(vector<int>& arr) {
+        sort(arr.begin(), arr.end());
+        int d = arr[1] - arr[0];
+        for (int i = 2; i < arr.size(); i++) {
+            if (arr[i] - arr[i - 1] != d) {
+                return false;
+            }
+        }
+        return true;
+    }
+};

solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/Solution.go

@@ -0,0 +1,10 @@
+func canMakeArithmeticProgression(arr []int) bool {
+	sort.Ints(arr)
+	d := arr[1] - arr[0]
+	for i := 2; i < len(arr); i++ {
+		if arr[i]-arr[i-1] != d {
+			return false
+		}
+	}
+	return true
+}

solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/Solution.java

@@ -1,8 +1,9 @@
 class Solution {
     public boolean canMakeArithmeticProgression(int[] arr) {
         Arrays.sort(arr);
-        for (int i = 1; i < arr.length - 1; ++i) {
-            if ((arr[i] << 1) != arr[i - 1] + arr[i + 1]) {
+        int d = arr[1] - arr[0];
+        for (int i = 2; i < arr.length; ++i) {
+            if (arr[i] - arr[i - 1] != d) {
                 return false;
             }
         }

solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/Solution.py

@@ -1,7 +1,5 @@
 class Solution:
     def canMakeArithmeticProgression(self, arr: List[int]) -> bool:
         arr.sort()
-        for i in range(1, len(arr) - 1):
-            if (arr[i] << 1) != arr[i - 1] + arr[i + 1]:
-                return False
-        return True
+        d = arr[1] - arr[0]
+        return all(b - a == d for a, b in pairwise(arr))