< Summary

Information
Class: LeetCode.Algorithms.LargestPerimeterTriangle.LargestPerimeterTriangleSorting
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\LargestPerimeterTriangle\LargestPerimeterTriangleSorting.cs
Line coverage
90%
Covered lines: 18
Uncovered lines: 2
Coverable lines: 20
Total lines: 53
Line coverage: 90%
Branch coverage
83%
Covered branches: 5
Total branches: 6
Branch coverage: 83.3%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
LargestPerimeter(...)83.33%6688.23%
NumsComparison(...)100%11100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\LargestPerimeterTriangle\LargestPerimeterTriangleSorting.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.LargestPerimeterTriangle;
 13
 14/// <inheritdoc />
 15public sealed class LargestPerimeterTriangleSorting : ILargestPerimeterTriangle
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n log n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public int LargestPerimeter(int[] nums)
 224    {
 225        var numsLength = nums.Length;
 26
 227        if (numsLength < 3)
 028        {
 029            return 0;
 30        }
 31
 232        Array.Sort(nums, NumsComparison);
 33
 834        for (var i = numsLength - 3; i >= 0; i--)
 335        {
 336            var a = nums[i];
 337            var b = nums[i + 1];
 338            var c = nums[i + 2];
 39
 340            if (a + b > c)
 141            {
 142                return a + b + c;
 43            }
 244        }
 45
 146        return 0;
 247    }
 48
 49    private static int NumsComparison(int x, int y)
 750    {
 751        return x - y;
 752    }
 53}