< Summary

Information
Class: LeetCode.Algorithms.ConvertBinaryNumberInLinkedListToInteger.ConvertBinaryNumberInLinkedListToIntegerIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ConvertBinaryNumberInLinkedListToInteger\ConvertBinaryNumberInLinkedListToIntegerIterative.cs
Line coverage
100%
Covered lines: 11
Uncovered lines: 0
Coverable lines: 11
Total lines: 41
Line coverage: 100%
Branch coverage
100%
Covered branches: 2
Total branches: 2
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
GetDecimalValue(...)100%22100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ConvertBinaryNumberInLinkedListToInteger\ConvertBinaryNumberInLinkedListToIntegerIterative.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.ConvertBinaryNumberInLinkedListToInteger;
 15
 16/// <inheritdoc />
 17public class ConvertBinaryNumberInLinkedListToIntegerIterative : IConvertBinaryNumberInLinkedListToInteger
 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 int GetDecimalValue(ListNode head)
 226    {
 227        var result = 0;
 28
 229        var current = head;
 30
 631        while (current != null)
 432        {
 433            result *= 2;
 434            result += current.val;
 35
 436            current = current.next;
 437        }
 38
 239        return result;
 240    }
 41}