翻之矩阵中的行

实现代码：

public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int m = scanner.nextInt();
        scanner.nextLine(); // 换行
        
        char[][] mat = new char[n][];
        for (int i = 0; i < n; i++) {
            mat[i] = scanner.nextLine().toCharArray();
        }
        
        // 统计列模式的出现次数
        Map<String, Integer> freq = new HashMap<>();
        for (int j = 0; j < m; j++) {
            StringBuilder col = new StringBuilder();
            for (int i = 0; i < n; i++) {
                col.append(mat[i][j]);
            }
            String colStr = col.toString();
            freq.put(colStr, freq.getOrDefault(colStr, 0) + 1);
        }
        
        int maxCols = 0;
        for (int count : freq.values()) {
            maxCols = Math.max(maxCols, count);
        }
        
        System.out.println(maxCols);
    }