Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitf8b09f4

Browse files
add 2229
1 parentbc5f38e commitf8b09f4

File tree

2 files changed

+20
-1
lines changed

2 files changed

+20
-1
lines changed

‎README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,7 @@ _If you like this project, please leave me a star._ ★
3232
| 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||
3333
| 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||
3434
| 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||
35-
|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||
35+
|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||
3636
| 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||
3737
| 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||
3838
| 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||
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
packagecom.fishercoder.solutions;
2+
3+
importjava.util.TreeSet;
4+
5+
publicclass_2229 {
6+
publicstaticclassSolution1 {
7+
publicbooleanisConsecutive(int[]nums) {
8+
TreeSet<Integer>treeSet =newTreeSet<>();
9+
intmin =nums[0];
10+
intmax =nums[0];
11+
for (intnum :nums) {
12+
treeSet.add(num);
13+
min =Math.min(min,num);
14+
max =Math.max(max,num);
15+
}
16+
returntreeSet.size() ==max -min +1 &&treeSet.size() ==nums.length;
17+
}
18+
}
19+
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp