We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1811863 commit 1c8a86bCopy full SHA for 1c8a86b
src/main/java/g3501_3600/s3583_count_special_triplets/Solution.java
@@ -15,7 +15,7 @@ public int specialTriplets(int[] nums) {
15
for (int i = 0; i < nums.length; i++) {
16
int curr = nums[i];
17
long leftCount = curr == 0 ? left[i] - 1 : left[i];
18
- long rightCount = sum[curr * 2] - left[i];
+ long rightCount = sum[curr * 2] - (long) left[i];
19
if (leftCount != 0 && rightCount != 0) {
20
ans += leftCount * rightCount;
21
}
0 commit comments