< Summary

Information
Class: LeetCode.Algorithms.FindValidMatrixGivenRowAndColumnSums.FindValidMatrixGivenRowAndColumnSumsGreedy
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindValidMatrixGivenRowAndColumnSums\FindValidMatrixGivenRowAndColumnSumsGreedy.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 44
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
RestoreMatrix(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindValidMatrixGivenRowAndColumnSums\FindValidMatrixGivenRowAndColumnSumsGreedy.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.FindValidMatrixGivenRowAndColumnSums;
 13
 14/// <inheritdoc />
 15public class FindValidMatrixGivenRowAndColumnSumsGreedy : IFindValidMatrixGivenRowAndColumnSums
 16{
 17    /// <summary>
 18    ///     Time complexity - O(m^2 * n)
 19    ///     Space complexity - O(m * n)
 20    /// </summary>
 21    /// <param name="rowSum"></param>
 22    /// <param name="colSum"></param>
 23    /// <returns></returns>
 24    public int[][] RestoreMatrix(int[] rowSum, int[] colSum)
 225    {
 226        var result = new int[rowSum.Length][];
 27
 1428        for (var i = 0; i < result.Length; i++)
 529        {
 530            result[i] = new int[colSum.Length];
 31
 3632            for (var j = 0; j < result[i].Length; j++)
 1333            {
 1334                var minSum = Math.Min(rowSum[i], colSum[j]);
 35
 1336                result[i][j] = minSum;
 1337                rowSum[i] -= minSum;
 1338                colSum[j] -= minSum;
 1339            }
 540        }
 41
 242        return result;
 243    }
 44}