Package g0301_0400.s0329_longest_increasing_path_in_a_matrix

Class Solution

java.lang.Object
g0301_0400.s0329_longest_increasing_path_in_a_matrix.Solution
public class Solution extends Object
329 - Longest Increasing Path in a Matrix.<p>Hard</p> <p>Given an <code>m x n</code> integers <code>matrix</code>, return <em>the length of the longest increasing path in</em> <code>matrix</code>.</p> <p>From each cell, you can either move in four directions: left, right, up, or down. You <strong>may not</strong> move <strong>diagonally</strong> or move <strong>outside the boundary</strong> (i.e., wrap-around is not allowed).</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/01/05/grid1.jpg" alt="" /></p> <p><strong>Input:</strong> matrix = [[9,9,4],[6,6,8],[2,1,1]]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> The longest increasing path is <code>[1, 2, 6, 9]</code>.</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/01/27/tmp-grid.jpg" alt="" /></p> <p><strong>Input:</strong> matrix = [[3,4,5],[3,2,6],[2,2,1]]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> The longest increasing path is <code>[3, 4, 5, 6]</code>. Moving diagonally is not allowed.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> matrix = [[1]]</p> <p><strong>Output:</strong> 1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>m == matrix.length</code></li> <li><code>n == matrix[i].length</code></li> <li><code>1 <= m, n <= 200</code></li> <li><code>0 <= matrix[i][j] <= 2<sup>31</sup> - 1</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • longestIncreasingPath

      public int longestIncreasingPath(int[][] matrix)