< Summary

Information
Class: LeetCode.Algorithms.RomanToInteger.RomanToIntegerIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RomanToInteger\RomanToIntegerIterative.cs
Line coverage
100%
Covered lines: 19
Uncovered lines: 0
Coverable lines: 19
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
RomanToInt(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RomanToInteger\RomanToIntegerIterative.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.Algorithms.RomanToInteger.Iterative;
 13
 14namespace LeetCode.Algorithms.RomanToInteger;
 15
 16/// <inheritdoc />
 17public class RomanToIntegerIterative : IRomanToInteger
 18{
 19    /// <summary>
 20    ///     Time complexity - O(n)
 21    ///     Space complexity - O(n)
 22    /// </summary>
 23    /// <param name="romanString"></param>
 24    /// <returns></returns>
 25    public int RomanToInt(string romanString)
 326    {
 327        List<RomanNumeral> romanNumerals = [];
 28
 3029        for (var i = 0; i < romanString.Length; i++)
 1230        {
 1231            var currentChar = romanString.ElementAt(i);
 1232            var nextChar = romanString.ElementAtOrDefault(i + 1);
 33
 1234            var subtractiveRomanNumeral = SubtractiveRomanNumeral.SubtractiveRomanNumerals.FirstOrDefault(
 7635                s => s.Symbol.Char.Equals(currentChar) && s.SecondSymbol.Char.Equals(nextChar));
 36
 1237            if (subtractiveRomanNumeral != null)
 338            {
 339                romanNumerals.Add(subtractiveRomanNumeral);
 340                i++;
 341            }
 42            else
 943            {
 2844                romanNumerals.Add(RomanNumeral.RomanNumerals.First(s => s.Symbol.Char.Equals(currentChar)));
 945            }
 1246        }
 47
 1548        return romanNumerals.Sum(romanNumeral => romanNumeral.Value);
 349    }
 50}

Methods/Properties

RomanToInt(System.String)