< Summary

Information
Class: LeetCode.Algorithms.RotateArray.RotateArrayReverseWithTwoPointers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RotateArray\RotateArrayReverseWithTwoPointers.cs
Line coverage
100%
Covered lines: 18
Uncovered lines: 0
Coverable lines: 18
Total lines: 49
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
Rotate(...)100%22100%
Reverse(...)100%22100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RotateArray\RotateArrayReverseWithTwoPointers.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.RotateArray;
 13
 14/// <inheritdoc />
 15public sealed class RotateArrayReverseWithTwoPointers : IRotateArray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <param name="k"></param>
 23    public void Rotate(int[] nums, int k)
 524    {
 525        var n = nums.Length;
 26
 527        k %= n;
 28
 529        if (k == 0)
 330        {
 331            return;
 32        }
 33
 234        Reverse(nums, 0, n - 1);
 235        Reverse(nums, 0, k - 1);
 236        Reverse(nums, k, n - 1);
 537    }
 38
 39    private static void Reverse(Span<int> nums, int left, int right)
 640    {
 1641        while (left < right)
 1042        {
 1043            (nums[left], nums[right]) = (nums[right], nums[left]);
 44
 1045            left++;
 1046            right--;
 1047        }
 648    }
 49}