< Summary

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

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FlippingAnImage\FlippingAnImageTwoPointers.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.FlippingAnImage;
 13
 14/// <inheritdoc />
 15public class FlippingAnImageTwoPointers : IFlippingAnImage
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n * m)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="image"></param>
 22    /// <returns></returns>
 23    public int[][] FlipAndInvertImage(int[][] image)
 224    {
 2025        foreach (var row in image)
 726        {
 727            var left = 0;
 728            var right = row.Length - 1;
 29
 1830            while (left < right)
 1131            {
 1132                (row[left], row[right]) = (row[right] ^ 1, row[left] ^ 1);
 33
 1134                left++;
 1135                right--;
 1136            }
 37
 738            if (left == right)
 339            {
 340                row[left] ^= 1;
 341            }
 742        }
 43
 244        return image;
 245    }
 46}