feat: add solutions to lc problem: No.1502. Can Make Arithmetic Progression From Sequence

yanglbme · yanglbme · commit 2c77ad7f0efa · 2021-05-19T23:02:57.000+08:00
diff --git a/solution/1500-1599/1500.Design a File Sharing System/README.md b/solution/1500-1599/1500.Design a File Sharing System/README.md
@@ -91,8 +91,6 @@ fileSharing.join([]);        // 一个不拥有任何文件块的用户加入系
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-import queue
-
 class FileSharing:
 
     def __init__(self, m: int):
diff --git a/solution/1500-1599/1500.Design a File Sharing System/README_EN.md b/solution/1500-1599/1500.Design a File Sharing System/README_EN.md
@@ -134,8 +134,6 @@ fileSharing.join([]);        // A user who doesn&#39;t have any chunks joined th
 ### **Python3**
 
 ```python
-import queue
-
 class FileSharing:
 
     def __init__(self, m: int):
diff --git a/solution/1500-1599/1500.Design a File Sharing System/Solution.py b/solution/1500-1599/1500.Design a File Sharing System/Solution.py
@@ -1,5 +1,3 @@
-import queue
-
 class FileSharing:
 
     def __init__(self, m: int):
@@ -36,4 +34,4 @@ def request(self, userID: int, chunkID: int) -> List[int]:
 # obj = FileSharing(m)
 # param_1 = obj.join(ownedChunks)
 # obj.leave(userID)
-# param_3 = obj.request(userID,chunkID)
+# param_3 = obj.request(userID,chunkID)
diff --git a/solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/README.md b/solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/README.md
@@ -49,15 +49,31 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+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
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+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]) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**
diff --git a/solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/README_EN.md b/solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/README_EN.md
@@ -41,13 +41,29 @@
 ### **Python3**
 
 ```python
-
+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
 ```
 
 ### **Java**
 
 ```java
-
+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]) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**
diff --git a/solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/Solution.java b/solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/Solution.java
@@ -0,0 +1,11 @@
+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]) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
diff --git a/solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/Solution.py b/solution/1500-1599/1502.Can Make Arithmetic Progression From Sequence/Solution.py
@@ -0,0 +1,7 @@
+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
