add 2229

fishercoder1534 · fishercoder1534 · commit f8b09f49f421 · 2022-06-28T16:46:10.000-07:00
diff --git a/README.md b/README.md
@@ -32,7 +32,7 @@ _If you like this project, please leave me a star._ &#9733;
 | 2243 |[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2243.java)                                                                     || Easy                                                                          ||
 | 2239 |[Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2239.java)                                                                     || Easy                                                                          ||
 | 2236 |[Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2236.java)                                                                     || Easy                                                                          ||
-| 223  |[Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2236.java)                                                                     || Easy                                                                          ||
+| 2229 |[Check if an Array Is Consecutive](https://leetcode.com/problems/check-if-an-array-is-consecutive/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2229.java)                                                                     || Easy                                                                          ||
 | 2220 |[Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2220.java)                                                                     || Easy                                                                          ||
 | 2215 |[Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2215.java)                                                                     || Easy                                                                          ||
 | 2210 |[Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2210.java)                                                                     || Easy                                                                          ||
diff --git a/src/main/java/com/fishercoder/solutions/_2229.java b/src/main/java/com/fishercoder/solutions/_2229.java
@@ -0,0 +1,19 @@
+package com.fishercoder.solutions;
+
+import java.util.TreeSet;
+
+public class _2229 {
+    public static class Solution1 {
+        public boolean isConsecutive(int[] nums) {
+            TreeSet<Integer> treeSet = new TreeSet<>();
+            int min = nums[0];
+            int max = nums[0];
+            for (int num : nums) {
+                treeSet.add(num);
+                min = Math.min(min, num);
+                max = Math.max(max, num);
+            }
+            return treeSet.size() == max - min + 1 && treeSet.size() == nums.length;
+        }
+    }
+}
