< Summary

Information
Class: LeetCode.Algorithms.NumberOfSubstringsWithOnlyOnes.NumberOfSubstringsWithOnlyOnesCounting
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\NumberOfSubstringsWithOnlyOnes\NumberOfSubstringsWithOnlyOnesCounting.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 49
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
NumSub(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\NumberOfSubstringsWithOnlyOnes\NumberOfSubstringsWithOnlyOnesCounting.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2026 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.NumberOfSubstringsWithOnlyOnes;
 13
 14/// <inheritdoc />
 15public sealed class NumberOfSubstringsWithOnlyOnesCounting : INumberOfSubstringsWithOnlyOnes
 16{
 17    private const int Modulo = 1_000_000_007;
 18
 19    /// <summary>
 20    ///     Time complexity - O(n)
 21    ///     Space complexity - O(1)
 22    /// </summary>
 23    /// <param name="s"></param>
 24    /// <returns></returns>
 25    public int NumSub(string s)
 326    {
 327        var result = 0;
 28
 329        var count = 0;
 30
 3831        for (var i = 0; i < s.Length; i++)
 1632        {
 1633            var c = s[i];
 34
 1635            if (c == '1')
 1336            {
 1337                count++;
 38
 1339                result = (result + count) % Modulo;
 1340            }
 41            else
 342            {
 343                count = 0;
 344            }
 1645        }
 46
 347        return result;
 348    }
 49}

Methods/Properties

NumSub(System.String)