< Summary

Information
Class: LeetCode.Algorithms.MaximumNumberOfOperationsToMoveOnesToTheEnd.MaximumNumberOfOperationsToMoveOnesToTheEndGreedyCounting
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumNumberOfOperationsToMoveOnesToTheEnd\MaximumNumberOfOperationsToMoveOnesToTheEndGreedyCounting.cs
Line coverage
100%
Covered lines: 19
Uncovered lines: 0
Coverable lines: 19
Total lines: 48
Line coverage: 100%
Branch coverage
87%
Covered branches: 7
Total branches: 8
Branch coverage: 87.5%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MaxOperations(...)87.5%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumNumberOfOperationsToMoveOnesToTheEnd\MaximumNumberOfOperationsToMoveOnesToTheEndGreedyCounting.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.MaximumNumberOfOperationsToMoveOnesToTheEnd;
 13
 14/// <inheritdoc />
 15public sealed class MaximumNumberOfOperationsToMoveOnesToTheEndGreedyCounting : IMaximumNumberOfOperationsToMoveOnesToTh
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="s"></param>
 22    /// <returns></returns>
 23    public int MaxOperations(string s)
 224    {
 225        var count = 0;
 26
 227        var ones = 0;
 28
 2429        for (var i = 0; i < s.Length; i++)
 1030        {
 1031            if (s[i] == '0')
 332            {
 533                while (i + 1 < s.Length && s[i + 1] == '0')
 234                {
 235                    i++;
 236                }
 37
 338                count += ones;
 339            }
 40            else
 741            {
 742                ones++;
 743            }
 1044        }
 45
 246        return count;
 247    }
 48}

Methods/Properties

MaxOperations(System.String)