< Summary

Information
Class: LeetCode.Algorithms.SquaresOfSortedArray.SquaresOfSortedArrayTwoPointers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SquaresOfSortedArray\SquaresOfSortedArrayTwoPointers.cs
Line coverage
100%
Covered lines: 18
Uncovered lines: 0
Coverable lines: 18
Total lines: 46
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
SortedSquares(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SquaresOfSortedArray\SquaresOfSortedArrayTwoPointers.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.SquaresOfSortedArray;
 13
 14/// <inheritdoc />
 15public class SquaresOfSortedArrayTwoPointers : ISquaresOfSortedArray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public int[] SortedSquares(int[] nums)
 224    {
 225        var sortedSquares = new int[nums.Length];
 26
 227        var left = 0;
 228        var right = nums.Length - 1;
 29
 2430        for (var i = nums.Length - 1; i >= 0; i--)
 1031        {
 1032            if (Math.Abs(nums[left]) > Math.Abs(nums[right]))
 433            {
 434                sortedSquares[i] = (int)Math.Pow(nums[left], 2);
 435                left++;
 436            }
 37            else
 638            {
 639                sortedSquares[i] = (int)Math.Pow(nums[right], 2);
 640                right--;
 641            }
 1042        }
 43
 244        return sortedSquares;
 245    }
 46}

Methods/Properties

SortedSquares(System.Int32[])