| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.ConstructProductMatrix; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class ConstructProductMatrixPrefixSum : IConstructProductMatrix |
| | | 16 | | { |
| | | 17 | | private const int Modulo = 12_345; |
| | | 18 | | |
| | | 19 | | /// <summary> |
| | | 20 | | /// Time complexity - O(m * n) |
| | | 21 | | /// Space complexity - O(1) |
| | | 22 | | /// </summary> |
| | | 23 | | /// <param name="grid"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public int[][] ConstructProductMatrix(int[][] grid) |
| | 2 | 26 | | { |
| | 2 | 27 | | var m = grid.Length; |
| | 2 | 28 | | var n = grid[0].Length; |
| | | 29 | | |
| | 2 | 30 | | var result = new int[m][]; |
| | | 31 | | |
| | 14 | 32 | | for (var i = 0; i < m; i++) |
| | 5 | 33 | | { |
| | 5 | 34 | | result[i] = new int[n]; |
| | 5 | 35 | | } |
| | | 36 | | |
| | 2 | 37 | | var prefix = 1; |
| | | 38 | | |
| | 14 | 39 | | for (var i = 0; i < m; i++) |
| | 5 | 40 | | { |
| | 24 | 41 | | for (var j = 0; j < n; j++) |
| | 7 | 42 | | { |
| | 7 | 43 | | result[i][j] = prefix; |
| | | 44 | | |
| | 7 | 45 | | grid[i][j] %= Modulo; |
| | | 46 | | |
| | 7 | 47 | | prefix = prefix * grid[i][j] % Modulo; |
| | 7 | 48 | | } |
| | 5 | 49 | | } |
| | | 50 | | |
| | 2 | 51 | | var suffix = 1; |
| | | 52 | | |
| | 14 | 53 | | for (var i = m - 1; i >= 0; i--) |
| | 5 | 54 | | { |
| | 24 | 55 | | for (var j = n - 1; j >= 0; j--) |
| | 7 | 56 | | { |
| | 7 | 57 | | result[i][j] = result[i][j] * suffix % Modulo; |
| | | 58 | | |
| | 7 | 59 | | suffix = suffix * grid[i][j] % Modulo; |
| | 7 | 60 | | } |
| | 5 | 61 | | } |
| | | 62 | | |
| | 2 | 63 | | return result; |
| | 2 | 64 | | } |
| | | 65 | | } |