< Summary

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

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MaxDistance(...)100%22100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumDistanceInArrays\MaximumDistanceInArraysGreedy.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.MaximumDistanceInArrays;
 13
 14/// <inheritdoc />
 15public class MaximumDistanceInArraysGreedy : IMaximumDistanceInArrays
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="arrays"></param>
 22    /// <returns></returns>
 23    public int MaxDistance(IList<IList<int>> arrays)
 324    {
 325        var maxDistance = 0;
 26
 327        var max = arrays[0][arrays[0].Count - 1];
 328        var min = arrays[0][0];
 29
 1430        for (var i = 1; i < arrays.Count; i++)
 431        {
 432            var currentMin = arrays[i][0];
 433            var currentMax = arrays[i][^1];
 34
 435            maxDistance = Math.Max(maxDistance, Math.Abs(currentMax - min));
 436            maxDistance = Math.Max(maxDistance, Math.Abs(max - currentMin));
 37
 438            min = Math.Min(min, currentMin);
 439            max = Math.Max(max, currentMax);
 440        }
 41
 342        return maxDistance;
 343    }
 44}