< Summary

Information
Class: LeetCode.Algorithms.ContainerWithMostWater.ContainerWithMostWaterTwoPointers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ContainerWithMostWater\ContainerWithMostWaterTwoPointers.cs
Line coverage
100%
Covered lines: 25
Uncovered lines: 0
Coverable lines: 25
Total lines: 57
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
MaxArea(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ContainerWithMostWater\ContainerWithMostWaterTwoPointers.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.ContainerWithMostWater;
 13
 14/// <inheritdoc />
 15public sealed class ContainerWithMostWaterTwoPointers : IContainerWithMostWater
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="heights"></param>
 22    /// <returns></returns>
 23    public int MaxArea(int[] heights)
 224    {
 225        var left = 0;
 226        var right = heights.Length - 1;
 27
 228        var maxArea = 0;
 29
 1130        while (left < right)
 931        {
 932            var leftHeight = heights[left];
 933            var rightHeight = heights[right];
 934            var height = int.Min(leftHeight, rightHeight);
 35
 936            var width = right - left;
 37
 938            var area = height * width;
 39
 940            if (area > maxArea)
 341            {
 342                maxArea = area;
 343            }
 44
 945            if (leftHeight < rightHeight)
 146            {
 147                left++;
 148            }
 49            else
 850            {
 851                right--;
 852            }
 953        }
 54
 255        return maxArea;
 256    }
 57}

Methods/Properties

MaxArea(System.Int32[])