< Summary

Information
Class: LeetCode.Algorithms.FindAllNumbersDisappearedInArray.FindAllNumbersDisappearedInArrayMarking
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindAllNumbersDisappearedInArray\FindAllNumbersDisappearedInArrayMarking.cs
Line coverage
100%
Covered lines: 16
Uncovered lines: 0
Coverable lines: 16
Total lines: 44
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
FindDisappearedNumbers(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindAllNumbersDisappearedInArray\FindAllNumbersDisappearedInArrayMarking.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 FindAllNumbersDisappearedInArrayMarking : IFindAllNumbersDisappearedInArray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public IList<int> FindDisappearedNumbers(int[] nums)
 224    {
 225        var markedNums = new bool[nums.Length];
 26
 2627        foreach (var num in nums)
 1028        {
 1029            markedNums[num - 1] = true;
 1030        }
 31
 232        var result = new List<int>();
 33
 2434        for (var i = 0; i < markedNums.Length; i++)
 1035        {
 1036            if (!markedNums[i])
 337            {
 338                result.Add(i + 1);
 339            }
 1040        }
 41
 242        return result;
 243    }
 44}