< Summary

Information
Class: LeetCode.Algorithms.ShuffleTheArray.ShuffleTheArrayIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ShuffleTheArray\ShuffleTheArrayIterative.cs
Line coverage
100%
Covered lines: 12
Uncovered lines: 0
Coverable lines: 12
Total lines: 40
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
Shuffle(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ShuffleTheArray\ShuffleTheArrayIterative.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.ShuffleTheArray;
 13
 14/// <inheritdoc />
 15public class ShuffleTheArrayIterative : IShuffleTheArray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <param name="n"></param>
 23    /// <returns></returns>
 24    public int[] Shuffle(int[] nums, int n)
 325    {
 326        var result = new int[n * 2];
 27
 2428        for (var i = 0; i < n; i++)
 929        {
 930            result[i * 2] = nums[i];
 931        }
 32
 2433        for (var i = 0; i < n; i++)
 934        {
 935            result[(i * 2) + 1] = nums[i + n];
 936        }
 37
 338        return result;
 339    }
 40}