1878. Get Biggest Three Rhombus Sums in a Grid
https://leetcode.com/problems/get-biggest-three-rhombus-sums-in-a-grid
Description
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 cell. Below is an image of four valid rhombus shapes with the corresponding colored cells that should be included in each rhombus sum:
Return the biggest three distinct rhombus sums in the grid
in descending order*. If there are less than three distinct values, return all of them*.
Example 1:
Example 2:
Example 3:
Constraints:
m == grid.length
n == grid[i].length
1 <= m, n <= 50
1 <= grid[i][j] <= 105
ac
Last updated