< Summary

Information
Class: LeetCode.Algorithms.WaterBottles2.WaterBottles2Simulation
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\WaterBottles2\WaterBottles2Simulation.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 48
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
MaxBottlesDrunk(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\WaterBottles2\WaterBottles2Simulation.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.WaterBottles2;
 13
 14/// <inheritdoc />
 15public sealed class WaterBottles2Simulation : IWaterBottles2
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n), where n is the number of initial bottles
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="numBottles"></param>
 22    /// <param name="numExchange"></param>
 23    /// <returns></returns>
 24    public int MaxBottlesDrunk(int numBottles, int numExchange)
 225    {
 226        var drunkBottles = 0;
 27
 228        var emptyBottles = 0;
 29
 730        while (numBottles > 0)
 531        {
 532            drunkBottles += numBottles;
 533            emptyBottles += numBottles;
 34
 535            numBottles = 0;
 36
 1037            while (emptyBottles >= numExchange)
 538            {
 539                emptyBottles -= numExchange;
 40
 541                numBottles++;
 542                numExchange++;
 543            }
 544        }
 45
 246        return drunkBottles;
 247    }
 48}