子矩阵最大累加和

题目描述:

解法:
可以参考求和最大连续子数组解法

package com.DJL.ArraysMatrix;

import java.util.Arrays;
public class Practice_子矩阵最大累加和 {
    //求一维数组中的子数组的最大连续和
    static int solve_1(int[] arr) {
        int sumJ = arr[0];
        int max = sumJ;
        for (int j = 1; j < arr.length; j++) {
            if (sumJ >= 0) {
                sumJ += arr[j];
            } else {
                sumJ = arr[j];
            }
            if (sumJ > max) {
                max = sumJ;
            }
        }
        return max;
    }

    static int maxSum(int[][] matrix) {
        int beginRow = 0;//起始行
        int M = matrix.length;//行数
        int N = matrix[0].length;//列数
        int[] sums = new int[N];
        int max = 0;//历史上最大子矩阵的和
        while (beginRow < M) {
            for (int i = beginRow; i < M; i++) {
                //按列累加
                for (int j = 0; j < N; j++) {
                    sums[j] += matrix[i][j];
                }
                //累加完成之后
                int t = solve_1(sums);
                if (t > max) {
                    max = t;
                }
            }
            Arrays.fill(sums, 0);
            beginRow++;
        }
        return max;
    }

    public static void main(String[] args) {
        int[][] matrix = {
                {-90, 48, 78},
                {64, -40, 64},
                {-81, -7, 66}
        };
        matrix = new int[][]{{1, 2, -3}};
        int res = maxSum(matrix);
        System.out.println(res);
    }
}