< Summary

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

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MinOperations(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumOperationsToMakeBinaryArrayElementsEqualToOne1\MinimumOperationsToMakeBinaryArrayElementsEqualToOne1Greedy.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.MinimumOperationsToMakeBinaryArrayElementsEqualToOne1;
 13
 14/// <inheritdoc />
 15public class MinimumOperationsToMakeBinaryArrayElementsEqualToOne1Greedy :
 16    IMinimumOperationsToMakeBinaryArrayElementsEqualToOne1
 17{
 18    /// <summary>
 19    ///     Time complexity - O(n)
 20    ///     Space complexity - O(1)
 21    /// </summary>
 22    /// <param name="nums"></param>
 23    /// <returns></returns>
 24    public int MinOperations(int[] nums)
 325    {
 326        var minOperations = 0;
 27
 3228        for (var i = 0; i < nums.Length - 2; i++)
 1329        {
 1330            if (nums[i] == 1)
 431            {
 432                continue;
 33            }
 34
 935            nums[i] = 1;
 936            nums[i + 1] ^= 1;
 937            nums[i + 2] ^= 1;
 38
 939            minOperations++;
 940        }
 41
 342        if (nums[^1] == 0 || nums[^2] == 0)
 243        {
 244            return -1;
 45        }
 46
 147        return minOperations;
 348    }
 49}

Methods/Properties

MinOperations(System.Int32[])