< Summary

Information
Class: LeetCode.Algorithms.RemoveDuplicatesFromSortedList.RemoveDuplicatesFromSortedListIterativeReverse
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RemoveDuplicatesFromSortedList\RemoveDuplicatesFromSortedListIterativeReverse.cs
Line coverage
100%
Covered lines: 24
Uncovered lines: 0
Coverable lines: 24
Total lines: 57
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
DeleteDuplicates(...)100%66100%
Reverse(...)100%22100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RemoveDuplicatesFromSortedList\RemoveDuplicatesFromSortedListIterativeReverse.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.RemoveDuplicatesFromSortedList;
 15
 16/// <inheritdoc />
 17public class RemoveDuplicatesFromSortedListIterativeReverse : IRemoveDuplicatesFromSortedList
 18{
 19    /// <summary>
 20    ///     Time complexity - O(n)
 21    ///     Space complexity - O(1)
 22    /// </summary>
 23    /// <param name="head"></param>
 24    /// <returns></returns>
 25    public ListNode? DeleteDuplicates(ListNode? head)
 326    {
 327        ListNode? result = null;
 28
 1629        while (head != null)
 1330        {
 1331            if (result?.val != head.val)
 632            {
 633                result = new ListNode(head.val, result);
 634            }
 35
 1336            head = head.next;
 1337        }
 38
 339        return Reverse(result);
 340    }
 41
 42    public static ListNode? Reverse(ListNode? head)
 343    {
 344        ListNode? prev = null;
 345        var current = head;
 46
 947        while (current != null)
 648        {
 649            var next = current.next;
 650            current.next = prev;
 651            prev = current;
 652            current = next;
 653        }
 54
 355        return prev;
 356    }
 57}