< Summary

Information
Class: LeetCode.Algorithms.LeftAndRightSumDifferences.LeftAndRightSumDifferencesPrefixSum
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\LeftAndRightSumDifferences\LeftAndRightSumDifferencesPrefixSum.cs
Line coverage
100%
Covered lines: 18
Uncovered lines: 0
Coverable lines: 18
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
LeftRightDifference(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\LeftAndRightSumDifferences\LeftAndRightSumDifferencesPrefixSum.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.LeftAndRightSumDifferences;
 13
 14/// <inheritdoc />
 15public class LeftAndRightSumDifferencesPrefixSum : ILeftAndRightSumDifferences
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public int[] LeftRightDifference(int[] nums)
 224    {
 225        var leftSum = new int[nums.Length];
 26
 1027        for (var i = 0; i < nums.Length - 1; i++)
 328        {
 329            leftSum[i + 1] = leftSum[i] + nums[i];
 330        }
 31
 232        var rightSum = new int[nums.Length];
 33
 1034        for (var i = nums.Length - 1; i > 0; i--)
 335        {
 336            rightSum[i - 1] = rightSum[i] + nums[i];
 337        }
 38
 239        var result = new int[nums.Length];
 40
 1441        for (var i = 0; i < nums.Length; i++)
 542        {
 543            result[i] = Math.Abs(leftSum[i] - rightSum[i]);
 544        }
 45
 246        return result;
 247    }
 48}