< Summary

Information
Class: LeetCode.Algorithms.MaximizeHappinessOfSelectedChildren.MaximizeHappinessOfSelectedChildrenIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximizeHappinessOfSelectedChildren\MaximizeHappinessOfSelectedChildrenIterative.cs
Line coverage
100%
Covered lines: 16
Uncovered lines: 0
Coverable lines: 16
Total lines: 47
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
MaximumHappinessSum(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximizeHappinessOfSelectedChildren\MaximizeHappinessOfSelectedChildrenIterative.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.MaximizeHappinessOfSelectedChildren;
 13
 14/// <inheritdoc />
 15public class MaximizeHappinessOfSelectedChildrenIterative : IMaximizeHappinessOfSelectedChildren
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n log n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="happiness"></param>
 22    /// <param name="k"></param>
 23    /// <returns></returns>
 24    public long MaximumHappinessSum(int[] happiness, int k)
 525    {
 526        long result = 0;
 27
 528        Array.Sort(happiness);
 29
 530        var i = 0;
 31
 5432        while (k > 0)
 4933        {
 4934            var happinessValue = happiness[happiness.Length - 1 - i] - i;
 35
 4936            if (happinessValue > 0)
 4737            {
 4738                result += happinessValue;
 4739            }
 40
 4941            i++;
 4942            k--;
 4943        }
 44
 545        return result;
 546    }
 47}