< Summary

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

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\LargestLocalValuesInMatrix\LargestLocalValuesInMatrixBruteForce.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.LargestLocalValuesInMatrix;
 13
 14/// <inheritdoc />
 15public class LargestLocalValuesInMatrixBruteForce : ILargestLocalValuesInMatrix
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^2)
 19    ///     Space complexity - O(n^2)
 20    /// </summary>
 21    /// <param name="grid"></param>
 22    /// <returns></returns>
 23    public int[][] LargestLocal(int[][] grid)
 224    {
 225        var result = new int[grid.Length - 2][];
 26
 1427        for (var i = 0; i < grid.Length - 2; i++)
 528        {
 529            result[i] = new int[grid.Length - 2];
 30
 3631            for (var j = 0; j < grid.Length - 2; j++)
 1332            {
 10433                for (var k = 0; k < 3; k++)
 3934                {
 31235                    for (var l = 0; l < 3; l++)
 11736                    {
 11737                        result[i][j] = Math.Max(result[i][j], grid[i + k][j + l]);
 11738                    }
 3939                }
 1340            }
 541        }
 42
 243        return result;
 244    }
 45}

Methods/Properties

LargestLocal(System.Int32[][])