2658. Maximum Number of Fish in a Grid
Medium
You are given a 0-indexed 2D matrix grid
of size m x n
, where (r, c)
represents:
A land cell if
grid[r][c] = 0
, orA water cell containing
grid[r][c]
fish, ifgrid[r][c] > 0
.
A fisher can start at any water cell (r, c)
and can do the following operations any number of times:
Catch all the fish at cell
(r, c)
, orMove to any adjacent water cell.
Return the maximum number of fish the fisher can catch if he chooses his starting cell optimally, or 0
if no water cell exists.
An adjacent cell of the cell (r, c)
, is one of the cells (r, c + 1)
, (r, c - 1)
, (r + 1, c)
or (r - 1, c)
if it exists.
Example 1:
Example 2:
Constraints:
m == grid.length
n == grid[i].length
1 <= m, n <= 10
0 <= grid[i][j] <= 10
解題
Previous2602. Minimum Operations to Make All Array Elements EqualNext3065. Minimum Operations to Exceed Threshold Value I
Last updated