< Summary

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

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SubtractTheProductAndSumOfDigitsOfAnInteger\SubtractTheProductAndSumOfDigitsOfAnIntegerDivision.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.SubtractTheProductAndSumOfDigitsOfAnInteger;
 13
 14/// <inheritdoc />
 15public class SubtractTheProductAndSumOfDigitsOfAnIntegerDivision : ISubtractTheProductAndSumOfDigitsOfAnInteger
 16{
 17    /// <summary>
 18    ///     Time complexity - O(d), where d is the number of digits in the integer n
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="n"></param>
 22    /// <returns></returns>
 23    public int SubtractProductAndSum(int n)
 224    {
 225        var productOfDigits = 1;
 226        var sumOfDigits = 0;
 27
 928        while (n > 0)
 729        {
 730            var numericValue = n % 10;
 31
 732            productOfDigits *= numericValue;
 733            sumOfDigits += numericValue;
 34
 735            n /= 10;
 736        }
 37
 238        return productOfDigits - sumOfDigits;
 239    }
 40}