82.最少翻转次数使二矩阵回文I

原创已于 2024-11-15 12:57:04 修改 · 245 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #数据结构 #leetcode #python #java

于 2024-11-15 00:41:23 首次发布

class Solution {
    public int minFlips(int[][] grid) {
        int res1=0;
        int res2=0;
        for(int i=0;i<grid.length;i++){
            int begin=0;
            int end=grid[i].length-1;
            while(begin<end){
                if(grid[i][begin]!=grid[i][end]){
                    res1++;
                }
                begin++;
                end--;
            }
        }
        
        for(int i=0;i<grid[0].length;i++){
            int begin=0;
            int end=grid.length-1;
            while(begin<end){
                if(grid[begin][i]!=grid[end][i]){
                    res2++;
                }
                begin++;
                end--;
            }
        }
        return Math.min(res1,res2);
    }
}

class Solution(object):
    def minFlips(self, grid):
        res1=0
        res2=0
        for i in range(len(grid)):
            begin=0
            end=len(grid[i])-1
            while begin<end:
                if grid[i][begin]!=grid[i][end]:
                    res1+=1
                begin+=1
                end-=1
        
        for i in range(len(grid[0])):
            begin=0
            end=len(grid)-1
            while begin<end:
                if grid[begin][i]!=grid[end][i]:
                    res2+=1
                begin+=1
                end-=1
        return min(res1,res2)