| | | 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.DesignNeighborSumService; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class DesignNeighborSumServiceBruteForce : IDesignNeighborSumService |
| | | 16 | | { |
| | | 17 | | private readonly int[][] _grid; |
| | | 18 | | |
| | 1 | 19 | | public DesignNeighborSumServiceBruteForce(int[][] grid) |
| | 1 | 20 | | { |
| | 1 | 21 | | _grid = grid; |
| | 1 | 22 | | } |
| | | 23 | | |
| | | 24 | | /// <summary> |
| | | 25 | | /// Time complexity - O(m * n) |
| | | 26 | | /// Space complexity - O(1) |
| | | 27 | | /// </summary> |
| | | 28 | | /// <param name="value"></param> |
| | | 29 | | /// <returns></returns> |
| | | 30 | | public int AdjacentSum(int value) |
| | 2 | 31 | | { |
| | 2 | 32 | | var (x, y) = FindPosition(value); |
| | | 33 | | |
| | 2 | 34 | | var sum = 0; |
| | | 35 | | |
| | 2 | 36 | | if (x > 0) |
| | 1 | 37 | | { |
| | 1 | 38 | | sum += _grid[x - 1][y]; |
| | 1 | 39 | | } |
| | | 40 | | |
| | 2 | 41 | | if (x < _grid.Length - 1) |
| | 2 | 42 | | { |
| | 2 | 43 | | sum += _grid[x + 1][y]; |
| | 2 | 44 | | } |
| | | 45 | | |
| | 2 | 46 | | if (y > 0) |
| | 2 | 47 | | { |
| | 2 | 48 | | sum += _grid[x][y - 1]; |
| | 2 | 49 | | } |
| | | 50 | | |
| | 2 | 51 | | if (y < _grid[x].Length - 1) |
| | 2 | 52 | | { |
| | 2 | 53 | | sum += _grid[x][y + 1]; |
| | 2 | 54 | | } |
| | | 55 | | |
| | 2 | 56 | | return sum; |
| | 2 | 57 | | } |
| | | 58 | | |
| | | 59 | | /// <summary> |
| | | 60 | | /// Time complexity - O(m * n) |
| | | 61 | | /// Space complexity - O(1) |
| | | 62 | | /// </summary> |
| | | 63 | | /// <param name="value"></param> |
| | | 64 | | /// <returns></returns> |
| | | 65 | | public int DiagonalSum(int value) |
| | 2 | 66 | | { |
| | 2 | 67 | | var (x, y) = FindPosition(value); |
| | | 68 | | |
| | 2 | 69 | | var sum = 0; |
| | | 70 | | |
| | 2 | 71 | | if (x > 0 && y > 0) |
| | 2 | 72 | | { |
| | 2 | 73 | | sum += _grid[x - 1][y - 1]; |
| | 2 | 74 | | } |
| | | 75 | | |
| | 2 | 76 | | if (x > 0 && y < _grid[x].Length - 1) |
| | 1 | 77 | | { |
| | 1 | 78 | | sum += _grid[x - 1][y + 1]; |
| | 1 | 79 | | } |
| | | 80 | | |
| | 2 | 81 | | if (x < _grid.Length - 1 && y > 0) |
| | 1 | 82 | | { |
| | 1 | 83 | | sum += _grid[x + 1][y - 1]; |
| | 1 | 84 | | } |
| | | 85 | | |
| | 2 | 86 | | if (x < _grid.Length - 1 && y < _grid.Length - 1) |
| | 1 | 87 | | { |
| | 1 | 88 | | sum += _grid[x + 1][y + 1]; |
| | 1 | 89 | | } |
| | | 90 | | |
| | 2 | 91 | | return sum; |
| | 2 | 92 | | } |
| | | 93 | | |
| | | 94 | | private (int X, int Y) FindPosition(int value) |
| | 4 | 95 | | { |
| | 16 | 96 | | for (var i = 0; i < _grid.Length; i++) |
| | 8 | 97 | | { |
| | 50 | 98 | | for (var j = 0; j < _grid[i].Length; j++) |
| | 21 | 99 | | { |
| | 21 | 100 | | if (_grid[i][j] == value) |
| | 4 | 101 | | { |
| | 4 | 102 | | return (i, j); |
| | | 103 | | } |
| | 17 | 104 | | } |
| | 4 | 105 | | } |
| | | 106 | | |
| | 0 | 107 | | return (-1, -1); |
| | 4 | 108 | | } |
| | | 109 | | } |