< Summary

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

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\BagOfTokens\BagOfTokensTwoPointers.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.BagOfTokens;
 13
 14/// <inheritdoc />
 15public class BagOfTokensTwoPointers : IBagOfTokens
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n log n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="tokens"></param>
 22    /// <param name="power"></param>
 23    /// <returns></returns>
 24    public int BagOfTokensScore(int[] tokens, int power)
 325    {
 326        var score = 0;
 27
 328        Array.Sort(tokens);
 29
 330        var left = 0;
 331        var right = tokens.Length - 1;
 32
 833        while (left <= right)
 734        {
 735            if (power >= tokens[left])
 436            {
 437                power -= tokens[left];
 438                score++;
 439                left++;
 440            }
 341            else if (score >= 1 && left < right)
 142            {
 143                power += tokens[right];
 144                score--;
 145                right--;
 146            }
 47            else
 248            {
 249                break;
 50            }
 551        }
 52
 353        return score;
 354    }
 55}