Package g3301_3400.s3392_count_subarrays_of_length_three_with_a_condition

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer countSubarrays(IntArray nums)

      • Methods inherited from class java.lang.Object

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