10000 add 2367 · EthanHuang-Wisc/Leetcode-java@3f7413e · GitHub
[go: up one dir, main page]

Skip to content

Commit 3f7413e

Browse files
add 2367
1 parent ab53998 commit 3f7413e

File tree

2 files changed

+20
-0
lines changed

2 files changed

+20
-0
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
88

99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
11+
| 2367 |[Number of Arithmetic Triplets](https://leetcode.com/problems/number-of-arithmetic-triplets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2367.java) || Easy ||
1112
| 2363 |[Merge Similar Items](https://leetcode.com/problems/merge-similar-items/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2363.java) || Easy ||
1213
| 2357 |[Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2357.java) || Easy ||
1314
| 2352 |[Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2352.java) || Medium ||
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
package com.fishercoder.solutions;
2+
3+
public class _2367 {
4+
public static class Solution1 {
5+
public int arithmeticTriplets(int[] nums, int diff) {
6+
int count = 0;
7+
for (int i = 0; i < nums.length - 2; i++) {
8+
for (int j = i + 1; j < nums.length - 1; j++) {
9+
for (int k = j + 1; k < nums.length; k++) {
10+
if (nums[j] - nums[i] == nums[k] - nums[j] && nums[k] - nums[j] == diff) {
11+
count++;
12+
}
13+
}
14+
}
15+
}
16+
return count;
17+
}
18+
}
19+
}

0 commit comments

Comments
 (0)
0