< Summary

Information
Class: LeetCode.Algorithms.CountSubarraysWithScoreLessThanK.CountSubarraysWithScoreLessThanKBruteForce
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CountSubarraysWithScoreLessThanK\CountSubarraysWithScoreLessThanKBruteForce.cs
Line coverage
100%
Covered lines: 19
Uncovered lines: 0
Coverable lines: 19
Total lines: 51
Line coverage: 100%
Branch coverage
100%
Covered branches: 6
Total branches: 6
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
CountSubarrays(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CountSubarraysWithScoreLessThanK\CountSubarraysWithScoreLessThanKBruteForce.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.CountSubarraysWithScoreLessThanK;
 13
 14/// <inheritdoc />
 15public class CountSubarraysWithScoreLessThanKBruteForce : ICountSubarraysWithScoreLessThanK
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^2)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <param name="k"></param>
 23    /// <returns></returns>
 24    public long CountSubarrays(int[] nums, long k)
 225    {
 226        long result = 0;
 27
 2028        for (var i = 0; i < nums.Length; i++)
 829        {
 830            long sum = 0;
 31
 3832            for (var j = i; j < nums.Length; j++)
 1633            {
 1634                sum += nums[j];
 35
 1636                var length = j - i + 1;
 37
 1638                if (sum * length < k)
 1139                {
 1140                    result++;
 1141                }
 42                else
 543                {
 544                    break;
 45                }
 1146            }
 847        }
 48
 249        return result;
 250    }
 51}