< Summary

Information
Class: LeetCode.Algorithms.HarshadNumber.HarshadNumberIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\HarshadNumber\HarshadNumberIterative.cs
Line coverage
100%
Covered lines: 13
Uncovered lines: 0
Coverable lines: 13
Total lines: 43
Line coverage: 100%
Branch coverage
83%
Covered branches: 5
Total branches: 6
Branch coverage: 83.3%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
SumOfTheDigitsOfHarshadNumber(...)83.33%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\HarshadNumber\HarshadNumberIterative.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.HarshadNumber;
 13
 14/// <inheritdoc />
 15public class HarshadNumberIterative : IHarshadNumber
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="x"></param>
 22    /// <returns></returns>
 23    public int SumOfTheDigitsOfHarshadNumber(int x)
 224    {
 225        var sum = 0;
 26
 227        var number = x;
 28
 629        while (number > 0)
 430        {
 431            sum += number % 10;
 32
 433            number /= 10;
 434        }
 35
 236        if (sum == 0 || x % sum != 0)
 137        {
 138            return -1;
 39        }
 40
 141        return sum;
 242    }
 43}