< Summary

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

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SquaresOfSortedArray\SquaresOfSortedArrayIterative.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 SquaresOfSortedArrayIterative : ISquaresOfSortedArray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^2)
 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
 2427        for (var i = 0; i < nums.Length; i++)
 1028        {
 1029            var num = nums[i];
 1030            var squareNum = (int)Math.Pow(num, 2);
 31
 6032            for (var j = 0; j < i; j++)
 2033            {
 2034                if (sortedSquares[j] > squareNum)
 835                {
 836                    (sortedSquares[j], squareNum) = (squareNum, sortedSquares[j]);
 837                }
 2038            }
 39
 1040            sortedSquares[i] = squareNum;
 1041        }
 42
 243        return sortedSquares;
 244    }
 45}

Methods/Properties

SortedSquares(System.Int32[])