< Summary

Information
Class: LeetCode.Algorithms.FindScoreOfAnArrayAfterMarkingAllElements.FindScoreOfAnArrayAfterMarkingAllElementsSorting
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindScoreOfAnArrayAfterMarkingAllElements\FindScoreOfAnArrayAfterMarkingAllElementsSorting.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
FindScore(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindScoreOfAnArrayAfterMarkingAllElements\FindScoreOfAnArrayAfterMarkingAllElementsSorting.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.FindScoreOfAnArrayAfterMarkingAllElements;
 13
 14/// <inheritdoc />
 15public class FindScoreOfAnArrayAfterMarkingAllElementsSorting : IFindScoreOfAnArrayAfterMarkingAllElements
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n log n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public long FindScore(int[] nums)
 224    {
 225        long score = 0;
 226        var markedElements = new bool[nums.Length];
 27
 1428        var elements = nums.Select((value, index) => (Value: value, Index: index))
 1229            .OrderBy(e => e.Value)
 1430            .ThenBy(e => e.Index);
 31
 3032        foreach (var (value, index) in elements)
 1233        {
 1234            if (markedElements[index])
 635            {
 636                continue;
 37            }
 38
 639            score += value;
 640            markedElements[index] = true;
 41
 642            if (index > 0)
 543            {
 544                markedElements[index - 1] = true;
 545            }
 46
 647            if (index < nums.Length - 1)
 448            {
 449                markedElements[index + 1] = true;
 450            }
 651        }
 52
 253        return score;
 254    }
 55}

Methods/Properties

FindScore(System.Int32[])