| | | 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 | | |
| | | 12 | | namespace LeetCode.Algorithms.FindValidMatrixGivenRowAndColumnSums; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FindValidMatrixGivenRowAndColumnSumsBruteForce : 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) |
| | 2 | 25 | | { |
| | 2 | 26 | | var result = new int[rowSum.Length][]; |
| | | 27 | | |
| | 14 | 28 | | for (var i = 0; i < result.Length; i++) |
| | 5 | 29 | | { |
| | 5 | 30 | | result[i] = new int[colSum.Length]; |
| | | 31 | | |
| | 5 | 32 | | var currentRowSum = 0; |
| | | 33 | | |
| | 18 | 34 | | for (var j = 0; j < result[i].Length; j++) |
| | 9 | 35 | | { |
| | 9 | 36 | | var currentColSum = colSum[j]; |
| | | 37 | | |
| | 38 | 38 | | for (var k = 0; k < i; k++) |
| | 10 | 39 | | { |
| | 10 | 40 | | currentColSum -= result[k][j]; |
| | 10 | 41 | | } |
| | | 42 | | |
| | 9 | 43 | | var sum = Math.Min(currentColSum, rowSum[i] - currentRowSum); |
| | | 44 | | |
| | 9 | 45 | | result[i][j] = sum; |
| | | 46 | | |
| | 9 | 47 | | currentRowSum += sum; |
| | | 48 | | |
| | 9 | 49 | | if (currentRowSum >= rowSum[i]) |
| | 5 | 50 | | { |
| | 5 | 51 | | break; |
| | | 52 | | } |
| | 4 | 53 | | } |
| | 5 | 54 | | } |
| | | 55 | | |
| | 2 | 56 | | return result; |
| | 2 | 57 | | } |
| | | 58 | | } |