leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

3239.cpp (532B)

0 class Solution { 1 public: 2 int minFlips(const vector<vector<int>> &grid) const { 3 const int n = size(grid), m = size(grid[0]); 4 int row = 0, col = 0; 5 6 for (int i = 0; i < n; i++) { 7 int a = 0, b = m - 1; 8 while (a < b) 9 row += grid[i][a++] != grid[i][b--]; 10 } 11 12 for (int j = 0; j < m; j++) { 13 int a = 0, b = n - 1; 14 while (a < b) 15 col += grid[a++][j] != grid[b--][j]; 16 } 17 18 return min(row, col); 19 } 20 };