| | | 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.ScoreAfterFlippingMatrix; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class ScoreAfterFlippingMatrixIterative : IScoreAfterFlippingMatrix |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(m * n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="grid"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int MatrixScore(int[][] grid) |
| | 6 | 24 | | { |
| | 76 | 25 | | foreach (var row in grid) |
| | 29 | 26 | | { |
| | 29 | 27 | | if (row[0] != 0) |
| | 13 | 28 | | { |
| | 13 | 29 | | continue; |
| | | 30 | | } |
| | | 31 | | |
| | 88 | 32 | | for (var j = 0; j < row.Length; j++) |
| | 28 | 33 | | { |
| | 28 | 34 | | if (row[j] == 0) |
| | 20 | 35 | | { |
| | 20 | 36 | | row[j] = 1; |
| | 20 | 37 | | } |
| | | 38 | | else |
| | 8 | 39 | | { |
| | 8 | 40 | | row[j] = 0; |
| | 8 | 41 | | } |
| | 28 | 42 | | } |
| | 16 | 43 | | } |
| | | 44 | | |
| | 54 | 45 | | for (var j = 1; j < grid[0].Length; j++) |
| | 21 | 46 | | { |
| | 57 | 47 | | var countOfOnes = grid.Count(row => row[j] == 1); |
| | | 48 | | |
| | 21 | 49 | | if (countOfOnes >= grid.Length / 2.0) |
| | 11 | 50 | | { |
| | 11 | 51 | | continue; |
| | | 52 | | } |
| | | 53 | | |
| | 62 | 54 | | foreach (var row in grid) |
| | 16 | 55 | | { |
| | 16 | 56 | | if (row[j] == 0) |
| | 15 | 57 | | { |
| | 15 | 58 | | row[j] = 1; |
| | 15 | 59 | | } |
| | | 60 | | else |
| | 1 | 61 | | { |
| | 1 | 62 | | row[j] = 0; |
| | 1 | 63 | | } |
| | 16 | 64 | | } |
| | 10 | 65 | | } |
| | | 66 | | |
| | 6 | 67 | | var score = 0; |
| | | 68 | | |
| | 76 | 69 | | foreach (var row in grid) |
| | 29 | 70 | | { |
| | 188 | 71 | | for (var k = 0; k < row.Length; k++) |
| | 65 | 72 | | { |
| | 65 | 73 | | if (row[k] == 1) |
| | 58 | 74 | | { |
| | 58 | 75 | | score += (int)Math.Pow(2, row.Length - 1 - k); |
| | 58 | 76 | | } |
| | 65 | 77 | | } |
| | 29 | 78 | | } |
| | | 79 | | |
| | 6 | 80 | | return score; |
| | 6 | 81 | | } |
| | | 82 | | } |