< Summary

Information
Class: LeetCode.Algorithms.MaximumProductOfTwoElementsInAnArray.MaximumProductOfTwoElementsInAnArraySecondMax
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumProductOfTwoElementsInAnArray\MaximumProductOfTwoElementsInAnArraySecondMax.cs
Line coverage
100%
Covered lines: 16
Uncovered lines: 0
Coverable lines: 16
Total lines: 43
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
MaxProduct(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumProductOfTwoElementsInAnArray\MaximumProductOfTwoElementsInAnArraySecondMax.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.MaximumProductOfTwoElementsInAnArray;
 13
 14/// <inheritdoc />
 15public class MaximumProductOfTwoElementsInAnArraySecondMax : IMaximumProductOfTwoElementsInAnArray
 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 MaxProduct(int[] nums)
 324    {
 325        var firstMax = 0;
 326        var secondMax = 0;
 27
 2928        foreach (var num in nums)
 1029        {
 1030            if (num > firstMax)
 731            {
 732                secondMax = firstMax;
 733                firstMax = num;
 734            }
 35            else
 336            {
 337                secondMax = Math.Max(secondMax, num);
 338            }
 1039        }
 40
 341        return (firstMax - 1) * (secondMax - 1);
 342    }
 43}

Methods/Properties

MaxProduct(System.Int32[])