363. Max Sum of Rectangle No Larger Than K

Given a non-empty 2D matrix matrix and an integer k, find the max sum of a rectangle in the matrix such that its sum is no larger than k.

Example:

Given matrix = [
  [1,  0, 1],
  [0, -2, 3]
]
k = 2

The answer is 2. Because the sum of rectangle [[0, 1], [-2, 3]] is 2 and 2 is the max number no larger than k (k = 2).

Note:

1. The rectangle inside the matrix must have an area > 0.
2. What if the number of rows is much larger than the number of columns?

思路：

将该题目分解为两个部分：

1、求得矩阵中，所有子矩阵的和的最大数

2、求一个数组中子序列之和不超过k的最大和

第一部分通过暴力求解。

第二部分通过一个treeSet求解，求sum[0-j] - sum[0-i] < k，这里采用treeSet求解，是因为treeSet本身是有序的，且插入过程时间复杂度为Log(n)，中间查找过程时间复杂度也为Log(n)，比较快，程序如下所示：

class Solution {
    public int maxSumSubmatrix(int[][] matrix, int k) {
        int maxVal = Integer.MIN_VALUE;
        int row = matrix.length, col = matrix[0].length;
        for (int i = 0; i < col; ++ i){
            int[] sumVal = new int[row];
            for (int j = i; j < col; ++ j){
                for (int m = 0; m < row; ++ m){
                    sumVal[m] += matrix[m][j];
                }
                int tmp = findNoBiggerThanK(sumVal, k);
                maxVal = Math.max(maxVal, tmp);
            }
        }
        return maxVal;
    }
    
    public int findNoBiggerThanK(int[] array, int k){
        TreeSet<Integer> set = new TreeSet<>();
        set.add(0);
        int currentSum = 0, target = Integer.MIN_VALUE;
        for (int val : array){
            currentSum += val;
            Integer tmp = set.ceiling(currentSum - k);
            if (tmp != null){
                target = Math.max(target, currentSum - tmp);
            }
            set.add(currentSum);
        }
        return target;
    }
}