< Summary

Information
Class: LeetCode.Algorithms.MaximumDifferenceBetweenIncreasingElements.MaximumDifferenceBetweenIncreasingElementsGreedy
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumDifferenceBetweenIncreasingElements\MaximumDifferenceBetweenIncreasingElementsGreedy.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 45
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
MaximumDifference(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumDifferenceBetweenIncreasingElements\MaximumDifferenceBetweenIncreasingElementsGreedy.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.MaximumDifferenceBetweenIncreasingElements;
 13
 14/// <inheritdoc />
 15public class MaximumDifferenceBetweenIncreasingElementsGreedy : IMaximumDifferenceBetweenIncreasingElements
 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 MaximumDifference(int[] nums)
 424    {
 425        var maximumDifference = -1;
 26
 427        var min = nums[0];
 28
 22429        for (var i = 1; i < nums.Length; i++)
 10830        {
 10831            if (nums[i] < min)
 9832            {
 9833                min = nums[i];
 9834            }
 1035            else if (nums[i] > min)
 536            {
 537                var difference = nums[i] - min;
 38
 539                maximumDifference = Math.Max(maximumDifference, difference);
 540            }
 10841        }
 42
 443        return maximumDifference;
 444    }
 45}