leetcode.com 2025-08-27
🔴3459.length-of-longest-v-shaped-diagonal-segment
🏷️ Tags
#memoization #array #dynamic_programming #matrix
🔴3459.length-of-longest-v-shaped-diagonal-segment
🏷️ Tags
#memoization #array #dynamic_programming #matrix
Telegraph
length-of-longest-v-shaped-diagonal-segment
You are given a 2D integer matrix grid of size n x m, where each element is either 0, 1, or 2. A V-shaped diagonal segment is defined as:
leetcode.cn 2025-10-03
🔴407.trapping-rain-water-ii
🏷️ Tags
#breadth_first_search #array #matrix #heap_priority_queue
🔴407.trapping-rain-water-ii
🏷️ Tags
#breadth_first_search #array #matrix #heap_priority_queue
Telegraph
trapping-rain-water-ii
给你一个 m x n 的矩阵,其中的值均为非负整数,代表二维高度图每个单元的高度,请计算图中形状最多能接多少体积的雨水。 示例 1: 输入: heightMap = [[1,4,3,1,3,2],[3,2,1,3,2,4],[2,3,3,2,3,1]] 输出: 4 解释: 下雨后,雨水将会被上图蓝色的方块中。总的接雨水量为1+2+1=4。 示例 2: 输入: heightMap = [[3,3,3,3,3],[3,2,2,2,3],[3,2,1,2,3],[3,2,2,2,3],[3,3,3,3,3]]…
leetcode.com 2025-10-03
🔴407.trapping-rain-water-ii
🏷️ Tags
#breadth_first_search #array #matrix #heap_priority_queue
🔴407.trapping-rain-water-ii
🏷️ Tags
#breadth_first_search #array #matrix #heap_priority_queue
Telegraph
trapping-rain-water-ii
Given an m x n integer matrix heightMap representing the height of each unit cell in a 2D elevation map, return the volume of water it can trap after raining. Example 1: Input: heightMap = [[1,4,3,1,3,2],[3,2,1,3,2,4],[2,3,3,2,3,1]] Output: 4 Explanation:…