< Summary

Information
Class: LeetCode.Algorithms.PassThePillow.PassThePillowSimulation
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\PassThePillow\PassThePillowSimulation.cs
Line coverage
100%
Covered lines: 25
Uncovered lines: 0
Coverable lines: 25
Total lines: 57
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
PassThePillow(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\PassThePillow\PassThePillowSimulation.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.PassThePillow;
 13
 14/// <inheritdoc />
 15public class PassThePillowSimulation : IPassThePillow
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="n"></param>
 22    /// <param name="time"></param>
 23    /// <returns></returns>
 24    public int PassThePillow(int n, int time)
 825    {
 826        var currentPerson = 1;
 27
 828        var isReversed = false;
 29
 830        var currentTime = 0;
 31
 408632        while (currentTime < time)
 407833        {
 407834            if (isReversed)
 203035            {
 203036                currentPerson--;
 203037            }
 38            else
 204839            {
 204840                currentPerson++;
 204841            }
 42
 407843            if (currentPerson == n)
 62844            {
 62845                isReversed = true;
 62846            }
 345047            else if (currentPerson == 1)
 62348            {
 62349                isReversed = false;
 62350            }
 51
 407852            currentTime++;
 407853        }
 54
 855        return currentPerson;
 856    }
 57}