< Summary

Information
Class: LeetCode.Algorithms.MaximumAscendingSubarraySum.MaximumAscendingSubarraySumIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumAscendingSubarraySum\MaximumAscendingSubarraySumIterative.cs
Line coverage
100%
Covered lines: 16
Uncovered lines: 0
Coverable lines: 16
Total lines: 44
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MaxAscendingSum(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumAscendingSubarraySum\MaximumAscendingSubarraySumIterative.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.MaximumAscendingSubarraySum;
 13
 14/// <inheritdoc />
 15public class MaximumAscendingSubarraySumIterative : IMaximumAscendingSubarraySum
 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 MaxAscendingSum(int[] nums)
 324    {
 325        var maxAscendingSum = nums[0];
 326        var currentAscendingSum = nums[0];
 27
 3628        for (var i = 1; i < nums.Length; i++)
 1529        {
 1530            if (nums[i] > nums[i - 1])
 1131            {
 1132                currentAscendingSum += nums[i];
 1133            }
 34            else
 435            {
 436                maxAscendingSum = Math.Max(maxAscendingSum, currentAscendingSum);
 37
 438                currentAscendingSum = nums[i];
 439            }
 1540        }
 41
 342        return Math.Max(maxAscendingSum, currentAscendingSum);
 343    }
 44}

Methods/Properties

MaxAscendingSum(System.Int32[])