< Summary

Information
Class: LeetCode.Algorithms.AddDigits.AddDigitsIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\AddDigits\AddDigitsIterative.cs
Line coverage
100%
Covered lines: 7
Uncovered lines: 0
Coverable lines: 7
Total lines: 32
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
AddDigits(...)100%22100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\AddDigits\AddDigitsIterative.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.AddDigits;
 13
 14/// <inheritdoc />
 15public class AddDigitsIterative : IAddDigits
 16{
 17    /// <summary>
 18    ///     Time complexity - O(log(n))
 19    ///     Space complexity - O(log(n))
 20    /// </summary>
 21    /// <param name="num"></param>
 22    /// <returns></returns>
 23    public int AddDigits(int num)
 224    {
 425        while (num > 9)
 226        {
 627            num = num.ToString().Sum(c => (int)char.GetNumericValue(c));
 228        }
 29
 230        return num;
 231    }
 32}

Methods/Properties

AddDigits(System.Int32)