Package g3301_3400.s3392_count_subarrays_of_length_three_with_a_condition

Class Solution

java.lang.Object

g3301_3400.s3392_count_subarrays_of_length_three_with_a_condition.Solution

public class Solution
extends Object

3392 - Count Subarrays of Length Three With a Condition.

Easy

Given an integer array nums, return the number of subarrays of length 3 such that the sum of the first and third numbers equals exactly half of the second number.

A subarray is a contiguous non-empty sequence of elements within an array.

Example 1:

Input: nums = [1,2,1,4,1]

Output: 1

Explanation:

Only the subarray [1,4,1] contains exactly 3 elements where the sum of the first and third numbers equals half the middle number.

Example 2:

Input: nums = [1,1,1]

Output: 0

Explanation:

[1,1,1] is the only subarray of length 3. However, its first and third numbers do not add to half the middle number.

Constraints:

• 3 <= nums.length <= 100
• -100 <= nums[i] <= 100

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	countSubarrays(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

countSubarrays

public int countSubarrays(int[] nums)