FPEvalRepoPublic/LeetCodeMetaData
0399
1{2 "id": 3391,3 "name": "maximum-difference-score-in-a-grid",4 "difficulty": "Medium",5 "link": "https://leetcode.com/problems/maximum-difference-score-in-a-grid/",6 "date": "2024-05-05",7 "task_description": "You are given an `m x n` matrix `grid` consisting of **positive** integers. You can move from a cell in the matrix to **any** other cell that is either to the bottom or to the right (not necessarily adjacent). The score of a move from a cell with the value `c1` to a cell with the value `c2` is `c2 - c1`. You can start at **any** cell, and you have to make **at least** one move. Return the **maximum** total score you can achieve. **Example 1:** **Input:** grid = [[9,5,7,3],[8,9,6,1],[6,7,14,3],[2,5,3,1]] **Output:** 9 **Explanation:** We start at the cell `(0, 1)`, and we perform the following moves: - Move from the cell `(0, 1)` to `(2, 1)` with a score of `7 - 5 = 2`. - Move from the cell `(2, 1)` to `(2, 2)` with a score of `14 - 7 = 7`. The total score is `2 + 7 = 9`. **Example 2:** **Input:** grid = [[4,3,2],[3,2,1]] **Output:** -1 **Explanation:** We start at the cell `(0, 0)`, and we perform one move: `(0, 0)` to `(0, 1)`. The score is `3 - 4 = -1`. **Constraints:** `m == grid.length` `n == grid[i].length` `2 <= m, n <= 1000` `4 <= m * n <= 105` `1 <= grid[i][j] <= 105`",8 "test_case": [9 {10 "label": "Example 1",11 "input": "grid = [[9,5,7,3],[8,9,6,1],[6,7,14,3],[2,5,3,1]]",12 "output": "9 "13 },14 {15 "label": "Example 2",16 "input": "grid = [[4,3,2],[3,2,1]]",17 "output": "-1 "18 }19 ],20 "constraints": [21 "m == grid.length",22 "n == grid[i].length",23 "2 <= m, n <= 1000",24 "4 <= m * n <= 105",25 "1 <= grid[i][j] <= 105"26 ],27 "python_template": "class Solution(object):\n def maxScore(self, grid):\n \"\"\"\n :type grid: List[List[int]]\n :rtype: int\n \"\"\"\n ",28 "java_template": "class Solution {\n public int maxScore(List<List<Integer>> grid) {\n \n }\n}",29 "metadata": {30 "func_name": "maxScore"31 }32}