leetcode.cn 2026-03-09
🟡3129.find-all-possible-stable-binary-arrays-i
🏷️ Tags
#dynamic_programming #prefix_sum
🟡3129.find-all-possible-stable-binary-arrays-i
🏷️ Tags
#dynamic_programming #prefix_sum
Telegraph
find-all-possible-stable-binary-arrays-i
给你 3 个正整数 zero ,one 和 limit 。 一个 二进制数组 arr 如果满足以下条件,那么我们称它是 稳定的 :
leetcode.com 2026-03-09
🟡3129.find-all-possible-stable-binary-arrays-i
🏷️ Tags
#dynamic_programming #prefix_sum
🟡3129.find-all-possible-stable-binary-arrays-i
🏷️ Tags
#dynamic_programming #prefix_sum
Telegraph
find-all-possible-stable-binary-arrays-i
You are given 3 positive integers zero, one, and limit. A binary array arr is called stable if:
leetcode.cn 2026-03-10
🔴3130.find-all-possible-stable-binary-arrays-ii
🏷️ Tags
#dynamic_programming #prefix_sum
🔴3130.find-all-possible-stable-binary-arrays-ii
🏷️ Tags
#dynamic_programming #prefix_sum
Telegraph
find-all-possible-stable-binary-arrays-ii
给你 3 个正整数 zero ,one 和 limit 。 一个 二进制数组 arr 如果满足以下条件,那么我们称它是 稳定的 :
leetcode.com 2026-03-10
🔴3130.find-all-possible-stable-binary-arrays-ii
🏷️ Tags
#dynamic_programming #prefix_sum
🔴3130.find-all-possible-stable-binary-arrays-ii
🏷️ Tags
#dynamic_programming #prefix_sum
Telegraph
find-all-possible-stable-binary-arrays-ii
You are given 3 positive integers zero, one, and limit. A binary array arr is called stable if:
leetcode.cn 2026-03-16
🟡1878.get-biggest-three-rhombus-sums-in-a-grid
🏷️ Tags
#array #math #matrix #prefix_sum #sorting #heap_priority_queue
🟡1878.get-biggest-three-rhombus-sums-in-a-grid
🏷️ Tags
#array #math #matrix #prefix_sum #sorting #heap_priority_queue
Telegraph
get-biggest-three-rhombus-sums-in-a-grid
给你一个 m x n 的整数矩阵 grid 。 菱形和 指的是 grid 中一个正菱形 边界 上的元素之和。本题中的菱形必须为正方形旋转45度,且四个角都在一个格子当中。下图是四个可行的菱形,每个菱形和应该包含的格子都用了相应颜色标注在图中。 注意,菱形可以是一个面积为 0 的区域,如上图中右下角的紫色菱形所示。 请你按照 降序 返回 grid 中三个最大的 互不相同的菱形和 。如果不同的和少于三个,则将它们全部返回。 示例 1: 输入:grid = [[3,4,5,1,3],[3,3,4,2,3]…
leetcode.com 2026-03-16
🟡1878.get-biggest-three-rhombus-sums-in-a-grid
🏷️ Tags
#array #math #matrix #prefix_sum #sorting #heap_priority_queue
🟡1878.get-biggest-three-rhombus-sums-in-a-grid
🏷️ Tags
#array #math #matrix #prefix_sum #sorting #heap_priority_queue
Telegraph
get-biggest-three-rhombus-sums-in-a-grid
You are given an m x n integer matrix grid. A rhombus sum is the sum of the elements that form the border of a regular rhombus shape in grid. The rhombus must have the shape of a square rotated 45 degrees with each of the corners centered in a grid…
leetcode.cn 2026-03-18
🟡3070.count-submatrices-with-top-left-element-and-sum-less-than-k
🏷️ Tags
#array #matrix #prefix_sum
🟡3070.count-submatrices-with-top-left-element-and-sum-less-than-k
🏷️ Tags
#array #matrix #prefix_sum
Telegraph
count-submatrices-with-top-left-element-and-sum-less-than-k
给你一个下标从 0 开始的整数矩阵 grid 和一个整数 k。 返回包含 grid 左上角元素、元素和小于或等于 k 的 子矩阵的数目。 示例 1: 输入:grid = [[7,6,3],[6,6,1]], k = 18 输出:4 解释:如上图所示,只有 4 个子矩阵满足:包含 grid 的左上角元素,并且元素和小于或等于 18 。 示例 2: 输入:grid = [[7,2,9],[1,5,0],[2,6,6]], k = 20 输出:6 解释:如上图所示,只有 6 个子矩阵满足:包含 grid …
leetcode.com 2026-03-18
🟡3070.count-submatrices-with-top-left-element-and-sum-less-than-k
🏷️ Tags
#array #matrix #prefix_sum
🟡3070.count-submatrices-with-top-left-element-and-sum-less-than-k
🏷️ Tags
#array #matrix #prefix_sum
Telegraph
count-submatrices-with-top-left-element-and-sum-less-than-k
You are given a 0-indexed integer matrix grid and an integer k. Return the number of submatrices that contain the top-left element of the grid, and have a sum less than or equal to k. Example 1: Input: grid = [[7,6,3],[6,6,1]], k = 18 Output: 4 Explanation:…
leetcode.cn 2026-03-19
🟡3212.count-submatrices-with-equal-frequency-of-x-and-y
🏷️ Tags
#array #matrix #prefix_sum
🟡3212.count-submatrices-with-equal-frequency-of-x-and-y
🏷️ Tags
#array #matrix #prefix_sum
Telegraph
count-submatrices-with-equal-frequency-of-x-and-y
给你一个二维字符矩阵 grid,其中 grid[i][j] 可能是 'X'、'Y' 或 '.',返回满足以下条件的子矩阵数量: