< Summary

Information
Class: LeetCode.Algorithms.WidestVerticalAreaBetweenTwoPointsContainingNoPoints.WidestVerticalAreaBetweenTwoPointsContainingNoPointsAscending
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\WidestVerticalAreaBetweenTwoPointsContainingNoPoints\WidestVerticalAreaBetweenTwoPointsContainingNoPointsAscending.cs
Line coverage
100%
Covered lines: 14
Uncovered lines: 0
Coverable lines: 14
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
MaxWidthOfVerticalArea(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\WidestVerticalAreaBetweenTwoPointsContainingNoPoints\WidestVerticalAreaBetweenTwoPointsContainingNoPointsAscending.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.WidestVerticalAreaBetweenTwoPointsContainingNoPoints;
 13
 14/// <inheritdoc />
 15public class WidestVerticalAreaBetweenTwoPointsContainingNoPointsAscending :
 16    IWidestVerticalAreaBetweenTwoPointsContainingNoPoints
 17{
 18    /// <summary>
 19    ///     Time complexity - O(n log n)
 20    ///     Space complexity - O(n)
 21    /// </summary>
 22    /// <param name="points"></param>
 23    /// <returns></returns>
 24    public int MaxWidthOfVerticalArea(int[][] points)
 225    {
 1226        var xValues = points.Select(p => p[0]).ToArray();
 27
 228        Array.Sort(xValues);
 29
 230        var maxWidth = 0;
 31
 2032        for (var i = 1; i < xValues.Length; i++)
 833        {
 834            var width = xValues[i] - xValues[i - 1];
 35
 836            if (width > maxWidth)
 337            {
 338                maxWidth = width;
 339            }
 840        }
 41
 242        return maxWidth;
 243    }
 44}