< Summary

Information
Class: LeetCode.Algorithms.NumberOfWaysToSplitArray.NumberOfWaysToSplitArrayPrefixSum
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\NumberOfWaysToSplitArray\NumberOfWaysToSplitArrayPrefixSum.cs
Line coverage
100%
Covered lines: 19
Uncovered lines: 0
Coverable lines: 19
Total lines: 48
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
WaysToSplitArray(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\NumberOfWaysToSplitArray\NumberOfWaysToSplitArrayPrefixSum.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.NumberOfWaysToSplitArray;
 13
 14/// <inheritdoc />
 15public class NumberOfWaysToSplitArrayPrefixSum : INumberOfWaysToSplitArray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public int WaysToSplitArray(int[] nums)
 224    {
 225        long leftSum = nums[0];
 226        long rightSum = 0;
 27
 1628        for (var i = 1; i < nums.Length; i++)
 629        {
 630            rightSum += nums[i];
 631        }
 32
 233        var result = 0;
 34
 1635        for (var i = 1; i < nums.Length; i++)
 636        {
 637            if (leftSum >= rightSum)
 438            {
 439                result++;
 440            }
 41
 642            leftSum += nums[i];
 643            rightSum -= nums[i];
 644        }
 45
 246        return result;
 247    }
 48}