【leetcode】1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold

题目如下: Given a m x n matrix mat and an integer threshold. Return the maximum side-length of a square with a sum less than or equal to threshold or return 0 if there is no such square. Example 1: Input: mat = [[1,1,3,2,4,3,2],[1,1,3,2,4,3,2],[1,1,3,2,4…

LeetCode 1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold

题目我是按照边进行二分的 class Solution { public: int sum[100005]; int a[305][305]; int maxSideLength(vector<vector<int>>& mat, int threshold) { if(threshold==0) return 0; int n = mat.size(); int m = mat[0].size(); int len = min(n,m); for(int i=0;i&l…

leetcode_1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold_[二维前缀和]

题目链接 Given a m x n matrix mat and an integer threshold. Return the maximum side-length of a square with a sum less than or equal to threshold or return 0 if there is no such square. Example 1: Input: mat = [[1,1,3,2,4,3,2],[1,1,3,2,4,3,2],[1,1,3,2,4,…

【LeetCode】718. Maximum Length of Repeated Subarray 解题报告（Python）

[LeetCode]718. Maximum Length of Repeated Subarray 解题报告(Python) 标签(空格分隔): LeetCode 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址:https://leetcode.com/problems/maximum-length-of-repeated-subarray/description/ 题目描述: Given two integer arr…

【leetcode】998. Maximum Binary Tree II

题目如下: We are given the root node of a maximum tree: a tree where every node has a value greater than any other value in its subtree. Just as in the previous problem, the given tree was constructed from an list A (root = Construct(A)) recursively with…

【LeetCode】662. Maximum Width of Binary Tree 解题报告（Python）

[LeetCode]662. Maximum Width of Binary Tree 解题报告(Python) 标签(空格分隔): LeetCode 题目地址:https://leetcode.com/problems/maximum-width-of-binary-tree/description/ 题目描述: Given a binary tree, write a function to get the maximum width of the given tree. The width…

【LeetCode】895. Maximum Frequency Stack 解题报告（Python）

[LeetCode]895. Maximum Frequency Stack 解题报告(Python) 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址:https://leetcode.com/problems/maximum-frequency-stack/description/ 题目描述: Implement FreqStack, a class which simulates the operation of a…

【leetcode】1239. Maximum Length of a Concatenated String with Unique Characters

题目如下: Given an array of strings arr. String s is a concatenation of a sub-sequence of arr which have unique characters. Return the maximum possible length of s. Example 1: Input: arr = ["un","iq","ue"] Output: 4 Explanation:…

【Leetcode】164. Maximum Gap 【基数排序】

Given an unsorted array, find the maximum difference between the successive elements in its sorted form. Return 0 if the array contains less than 2 elements. Try to solve it in linear time/space. 题目来源:力扣(LeetCode)链接:https://leetcode-cn.com/problems/m…

【LeetCode】646. Maximum Length of Pair Chain 解题报告（Python）

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法贪心算法日期题目地址:https://leetcode.com/problems/maximum-length-of-pair-chain/description/ 题目描述 You are given n pairs of numbers. In every pair, the first number is always smaller th…

【leetcode】1255. Maximum Score Words Formed by Letters

题目如下: Given a list of words, list of single letters (might be repeating) and score of every character. Return the maximum score of any valid set of words formed by using the given letters (words[i] cannot be used two or more times). It is not necess…

【leetcode】1189. Maximum Number of Balloons

题目如下: Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible. You can use each character in text at most once. Return the maximum number of instances that can be formed. Example 1:…

【LeetCode】998. Maximum Binary Tree II 解题报告（C++）

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法递归日期题目地址:https://leetcode.com/problems/maximum-binary-tree-ii/ 题目描述 We are given the root node of a maximum tree: a tree where every node has a value greater than any other v…

【LeetCode】962. Maximum Width Ramp 解题报告（Python）

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法单调栈日期题目地址:https://leetcode.com/problems/maximum-width-ramp/ 题目描述 Given an array A of integers, a ramp is a tuple (i, j) for which i < j and A[i] <= A[j]. The width of such a…

【LeetCode】628. Maximum Product of Three Numbers 解题报告（Python）

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法方法一:排序日期题目地址:https://leetcode.com/problems/maximum-product-of-three-numbers/description/ 题目描述 Given an integer array, find three numbers whose product is maximum and output t…

【LeetCode】689. Maximum Sum of 3 Non-Overlapping Subarrays 解题报告（Python）

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址: https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/description/ 题目描述: In a given array nums of positive integers, find three non-overlapping subarrays with maximum su…

【LeetCode】318. Maximum Product of Word Lengths 解题报告（Python）

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法 set 位运算日期题目地址:https://leetcode.com/problems/maximum-product-of-word-lengths/description/ 题目描述 Given a string array words, find the maximum value of length(word[i]) * length(w…

【leetcode】1235. Maximum Profit in Job Scheduling

题目如下: We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. You're given the startTime , endTime and profit arrays, you need to output the maximum profit you can take such that there…

【leetcode】689. Maximum Sum of 3 Non-Overlapping Subarrays

题目如下: In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum. Each subarray will be of size k, and we want to maximize the sum of all 3*k entries. Return the result as a list of indices representing the star…

【leetcode】1186. Maximum Subarray Sum with One Deletion

题目如下: Given an array of integers, return the maximum sum for a non-empty subarray (contiguous elements) with at most one element deletion. In other words, you want to choose a subarray and optionally delete one element from it so that there is still…

【leetcode】1131. Maximum of Absolute Value Expression

题目如下: Given two arrays of integers with equal lengths, return the maximum value of: |arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j| where the maximum is taken over all 0 <= i, j < arr1.length. Example 1: Input: arr1 = [1,2,3,4], arr2 = [-1,4,5,6…

【leetcode】1031. Maximum Sum of Two Non-Overlapping Subarrays

题目如下: Given an array A of non-negative integers, return the maximum sum of elements in two non-overlapping (contiguous) subarrays, which have lengths L and M. (For clarification, the L-length subarray could occur before or after the M-length subarra…

【leetcode】662. Maximum Width of Binary Tree

题目如下: Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a full binary tree, but some nodes are null. The width of one…