< Summary

Information
Class: LeetCode.Algorithms.FindAllNumbersDisappearedInArray.FindAllNumbersDisappearedInArraySignFlipping
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindAllNumbersDisappearedInArray\FindAllNumbersDisappearedInArraySignFlipping.cs
Line coverage
100%
Covered lines: 19
Uncovered lines: 0
Coverable lines: 19
Total lines: 47
Line coverage: 100%
Branch coverage
100%
Covered branches: 8
Total branches: 8
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
FindDisappearedNumbers(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindAllNumbersDisappearedInArray\FindAllNumbersDisappearedInArraySignFlipping.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.FindAllNumbersDisappearedInArray;
 13
 14/// <inheritdoc />
 15public class FindAllNumbersDisappearedInArraySignFlipping : IFindAllNumbersDisappearedInArray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public IList<int> FindDisappearedNumbers(int[] nums)
 224    {
 2425        for (var i = 0; i < nums.Length; i++)
 1026        {
 1027            var index = Math.Abs(nums[i]) - 1;
 28
 1029            if (nums[index] > 0)
 730            {
 731                nums[index] = -nums[index];
 732            }
 1033        }
 34
 235        var result = new List<int>();
 36
 2437        for (var i = 0; i < nums.Length; i++)
 1038        {
 1039            if (nums[i] > 0)
 340            {
 341                result.Add(i + 1);
 342            }
 1043        }
 44
 245        return result;
 246    }
 47}