add 1630

Author: fishercoder1534

Diff for: README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1630|[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1630.java) ||Sort|Medium|
 |1626|[Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1626.java) ||DP|Medium|
 |1625|[Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1625.java) ||BFS, DFS|Medium|
 |1624|[Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1624.java) ||String|Easy|

Diff for: src/main/java/com/fishercoder/solutions/_1630.java

@@ -0,0 +1,35 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+public class _1630 {
+    public static class Solution1 {
+        public List<Boolean> checkArithmeticSubarrays(int[] nums, int[] l, int[] r) {
+            List<Boolean> result = new ArrayList<>();
+            for (int i = 0; i < l.length; i++) {
+                if (isArithmetic(nums, l[i], r[i])) {
+                    result.add(true);
+                } else {
+                    result.add(false);
+                }
+            }
+            return result;
+        }
+
+        private boolean isArithmetic(int[] nums, int start, int end) {
+            List<Integer> list = new ArrayList<>();
+            for (int i = start; i <= end; i++) {
+                list.add(nums[i]);
+            }
+            Collections.sort(list);
+            for (int i = 1; i < list.size(); i++) {
+                if (list.get(i) - list.get(i - 1) != list.get(1) - list.get(0)) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}