| | | 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.MatrixSimilarityAfterCyclicShifts; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class MatrixSimilarityAfterCyclicShiftsMath : IMatrixSimilarityAfterCyclicShifts |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(m * n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="mat"></param> |
| | | 22 | | /// <param name="k"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public bool AreSimilar(int[][] mat, int k) |
| | 3 | 25 | | { |
| | 3 | 26 | | var m = mat.Length; |
| | 3 | 27 | | var n = mat[0].Length; |
| | | 28 | | |
| | 3 | 29 | | k %= n; |
| | | 30 | | |
| | 16 | 31 | | for (var i = 0; i < m; i++) |
| | 6 | 32 | | { |
| | 6 | 33 | | var row = mat[i]; |
| | | 34 | | |
| | 44 | 35 | | for (var j = 0; j < n; j++) |
| | 17 | 36 | | { |
| | 17 | 37 | | if (row[j] != row[(j + k) % n]) |
| | 1 | 38 | | { |
| | 1 | 39 | | return false; |
| | | 40 | | } |
| | 16 | 41 | | } |
| | 5 | 42 | | } |
| | | 43 | | |
| | 2 | 44 | | return true; |
| | 3 | 45 | | } |
| | | 46 | | } |