< Summary

Information
Class: LeetCode.Algorithms.NumberOfSmoothDescentPeriodsOfStock.NumberOfSmoothDescentPeriodsOfStockTwoPointers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\NumberOfSmoothDescentPeriodsOfStock\NumberOfSmoothDescentPeriodsOfStockTwoPointers.cs
Line coverage
100%
Covered lines: 18
Uncovered lines: 0
Coverable lines: 18
Total lines: 48
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
GetDescentPeriods(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\NumberOfSmoothDescentPeriodsOfStock\NumberOfSmoothDescentPeriodsOfStockTwoPointers.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2026 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.NumberOfSmoothDescentPeriodsOfStock;
 13
 14/// <inheritdoc />
 15public sealed class NumberOfSmoothDescentPeriodsOfStockTwoPointers : INumberOfSmoothDescentPeriodsOfStock
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="prices"></param>
 22    /// <returns></returns>
 23    public long GetDescentPeriods(int[] prices)
 1524    {
 1525        long result = 1;
 26
 1527        var left = 0;
 28
 11829        for (var right = 1; right < prices.Length; right++)
 4430        {
 4431            var previous = prices[right - 1];
 4432            var current = prices[right];
 33
 4434            if (previous - current == 1)
 3035            {
 3036                result += right - left + 1;
 3037            }
 38            else
 1439            {
 1440                left = right;
 41
 1442                result++;
 1443            }
 4444        }
 45
 1546        return result;
 1547    }
 48}