< Summary

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

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RemoveLinkedListElements\RemoveLinkedListElementsIterative.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
 12using LeetCode.Core.Models;
 13
 14namespace LeetCode.Algorithms.RemoveLinkedListElements;
 15
 16/// <inheritdoc />
 17public class RemoveLinkedListElementsIterative : IRemoveLinkedListElements
 18{
 19    /// <summary>
 20    ///     Time complexity - O(n)
 21    ///     Space complexity - O(1)
 22    /// </summary>
 23    /// <param name="head"></param>
 24    /// <param name="val"></param>
 25    /// <returns></returns>
 26    public ListNode? RemoveElements(ListNode? head, int val)
 527    {
 528        if (head == null)
 129        {
 130            return null;
 31        }
 32
 433        var dummyHead = new ListNode(next: head);
 434        var current = dummyHead;
 35
 1736        while (current.next != null)
 1337        {
 1338            if (current.next.val == val)
 739            {
 740                current.next = current.next.next;
 741            }
 42            else
 643            {
 644                current = current.next;
 645            }
 1346        }
 47
 448        return dummyHead.next;
 549    }
 50}