Home Backend Development PHP Tutorial Maximum Number of Moves in a Grid

Maximum Number of Moves in a Grid

Oct 30, 2024 pm 01:27 PM

2684. Maximum Number of Moves in a Grid

Difficulty: Medium

Topics: Array, Dynamic Programming, Matrix

You are given a 0-indexed m x n matrix grid consisting of positive integers.

You can start at any cell in the first column of the matrix, and traverse the grid in the following way:

  • From a cell (row, col), you can move to any of the cells: (row - 1, col 1), (row, col 1) and (row 1, col 1) such that the value of the cell you move to, should be strictly bigger than the value of the current cell.

Return the maximum number of moves that you can perform.

Example 1:

Maximum Number of Moves in a Grid

  • Input: grid = [[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]]
  • Output: 3
  • Explanation: We can start at the cell (0, 0) and make the following moves:
    • (0, 0) -> (0, 1).
    • (0, 1) -> (1, 2).
    • (1, 2) -> (2, 3). It can be shown that it is the maximum number of moves that can be made.

Example 2:

Maximum Number of Moves in a Grid

  • Input: grid = [[3,2,4],[2,1,9],[1,1,7]]
  • Output: 0
  • Explanation: Starting from any cell in the first column we cannot perform any moves.

Constraints:

  • m == grid.length
  • n == grid[i].length
  • 2 <= m, n <= 1000
  • 4 <= m * n <= 105
  • 1 <= grid[i][j] <= 106

Hint:

  1. Consider using dynamic programming to find the maximum number of moves that can be made from each cell.
  2. The final answer will be the maximum value in cells of the first column.

Solution:

We can use Dynamic Programming (DP) to keep track of the maximum number of moves from each cell, starting from any cell in the first column. Here’s the step-by-step approach:

Approach:

  1. Define DP Array: Let dp[row][col] represent the maximum number of moves possible starting from grid[row][col]. Initialize this with 0 for all cells.

  2. Traverse the Grid:

    • Start from the last column and move backward to the first column. For each cell in column col, calculate possible moves for col-1.
    • Update dp[row][col] based on possible moves (row - 1, col 1), (row, col 1), and (row 1, col 1), only if the value of the destination cell is strictly greater than the current cell.
  3. Calculate the Maximum Moves:

    • After filling out the dp table, the result will be the maximum value in the first column of dp, as it represents the maximum moves starting from any cell in the first column.
  4. Edge Cases:

    • Handle cases where no moves are possible (e.g., when all paths are blocked by lower or equal values in neighboring cells).

Let's implement this solution in PHP: 2684. Maximum Number of Moves in a Grid

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

<!--?php

/**

 * @param Integer[][] $grid

 * @return Integer

 */

function maxMoves($grid) {

    ...

    ...

    ...

    /**

     * go to ./solution.php

     */

}

 

// Example usage:

$grid1 = [[2,4,3,5],[5,4,9,3],[3,4,2,11],[10,9,13,15]];

$grid2 = [[3,2,4],[2,1,9],[1,1,7]];

 

echo maxMoves($grid1); // Output: 3

echo "\n";

echo maxMoves($grid2); // Output: 0

?-->

 

 

 

 

<h3>

   

   

  Explanation:

</h3>

 

<ol>

<li>

<strong>dp Initialization</strong>: We create a 2D array dp to store the maximum moves from each cell.</li>

<li>

<strong>Loop through Columns</strong>: We iterate from the second-last column to the first, updating dp[row][col] based on possible moves to neighboring cells in the next column.</li>

<li>

<strong>Maximum Moves Calculation</strong>: Finally, the maximum value in the first column of dp gives the result.</li>

</ol>

 

<h3>

   

   

  Complexity Analysis:

</h3>

 

<ul>

<li>

<strong>Time Complexity</strong>: <em><strong>O(m x n)</strong></em> since we process each cell once.</li>

<li>

<strong>Space Complexity</strong>: <em><strong>O(m x n)</strong></em> for the dp array.</li>

</ul>

 

<p>This solution is efficient given the constraints and will work within the provided limits.</p>

 

<p><strong>Contact Links</strong></p>

 

<p>If you found this series helpful, please consider giving the <strong>repository</strong> a star on GitHub or sharing the post on your favorite social networks ?. Your support would mean a lot to me!</p>

 

<p>If you want more helpful content like this, feel free to follow me:</p>

 

<ul>

<li><strong>LinkedIn</strong></li>

<li><strong>GitHub</strong></li>

</ul>

 

 

           

 

             

   

 

             

         

<p>The above is the detailed content of Maximum Number of Moves in a Grid. For more information, please follow other related articles on the PHP Chinese website!</p>

 

 

                        

Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Undress AI Tool

Undress AI Tool

Undress images for free

Clothoff.io

Clothoff.io

AI clothes remover

Video Face Swap

Video Face Swap

Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Tools

Notepad++7.3.1

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

Explain JSON Web Tokens (JWT) and their use case in PHP APIs. Explain JSON Web Tokens (JWT) and their use case in PHP APIs. Apr 05, 2025 am 12:04 AM

JWT is an open standard based on JSON, used to securely transmit information between parties, mainly for identity authentication and information exchange. 1. JWT consists of three parts: Header, Payload and Signature. 2. The working principle of JWT includes three steps: generating JWT, verifying JWT and parsing Payload. 3. When using JWT for authentication in PHP, JWT can be generated and verified, and user role and permission information can be included in advanced usage. 4. Common errors include signature verification failure, token expiration, and payload oversized. Debugging skills include using debugging tools and logging. 5. Performance optimization and best practices include using appropriate signature algorithms, setting validity periods reasonably,

How does session hijacking work and how can you mitigate it in PHP? How does session hijacking work and how can you mitigate it in PHP? Apr 06, 2025 am 12:02 AM

Session hijacking can be achieved through the following steps: 1. Obtain the session ID, 2. Use the session ID, 3. Keep the session active. The methods to prevent session hijacking in PHP include: 1. Use the session_regenerate_id() function to regenerate the session ID, 2. Store session data through the database, 3. Ensure that all session data is transmitted through HTTPS.

What are Enumerations (Enums) in PHP 8.1? What are Enumerations (Enums) in PHP 8.1? Apr 03, 2025 am 12:05 AM

The enumeration function in PHP8.1 enhances the clarity and type safety of the code by defining named constants. 1) Enumerations can be integers, strings or objects, improving code readability and type safety. 2) Enumeration is based on class and supports object-oriented features such as traversal and reflection. 3) Enumeration can be used for comparison and assignment to ensure type safety. 4) Enumeration supports adding methods to implement complex logic. 5) Strict type checking and error handling can avoid common errors. 6) Enumeration reduces magic value and improves maintainability, but pay attention to performance optimization.

Describe the SOLID principles and how they apply to PHP development. Describe the SOLID principles and how they apply to PHP development. Apr 03, 2025 am 12:04 AM

The application of SOLID principle in PHP development includes: 1. Single responsibility principle (SRP): Each class is responsible for only one function. 2. Open and close principle (OCP): Changes are achieved through extension rather than modification. 3. Lisch's Substitution Principle (LSP): Subclasses can replace base classes without affecting program accuracy. 4. Interface isolation principle (ISP): Use fine-grained interfaces to avoid dependencies and unused methods. 5. Dependency inversion principle (DIP): High and low-level modules rely on abstraction and are implemented through dependency injection.

How to debug CLI mode in PHPStorm? How to debug CLI mode in PHPStorm? Apr 01, 2025 pm 02:57 PM

How to debug CLI mode in PHPStorm? When developing with PHPStorm, sometimes we need to debug PHP in command line interface (CLI) mode...

How to send a POST request containing JSON data using PHP's cURL library? How to send a POST request containing JSON data using PHP's cURL library? Apr 01, 2025 pm 03:12 PM

Sending JSON data using PHP's cURL library In PHP development, it is often necessary to interact with external APIs. One of the common ways is to use cURL library to send POST�...

Explain late static binding in PHP (static::). Explain late static binding in PHP (static::). Apr 03, 2025 am 12:04 AM

Static binding (static::) implements late static binding (LSB) in PHP, allowing calling classes to be referenced in static contexts rather than defining classes. 1) The parsing process is performed at runtime, 2) Look up the call class in the inheritance relationship, 3) It may bring performance overhead.

See all articles