本 的专栏

原网址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 matrix = [ [1, 0, 1], [0, -2, 3] ]

这道题，BF 时间复杂度O(n^2)public static int subarraySum(int[] nums, int k) { long [][] map = new long [nums.length+1][nums.length+1]; long[] odd = new long[nums.length+1]; long[] even =