08 2017 档案

LeetCode 363：Max Sum of Rectangle No Larger Than K
摘要：题目链接 链接： "https://leetcode.com/problems/max sum of rectangle no larger than k/description/" 题解&代码 1、暴力枚举所有的情况，时间复杂度O(n^2 m^2)，实际耗时759 ms class Solutio 阅读全文
posted @ 2017-08-03 11:50 fenicnn 阅读(154) 评论(0) 推荐(0)