成人国产在线小视频_日韩寡妇人妻调教在线播放_色成人www永久在线观看_2018国产精品久久_亚洲欧美高清在线30p_亚洲少妇综合一区_黄色在线播放国产_亚洲另类技巧小说校园_国产主播xx日韩_a级毛片在线免费

資訊專欄INFORMATION COLUMN

[LeetCode] 329. Longest Increasing Path in a Matri

antz / 3129人閱讀

Problem

Given an integer matrix, find the length of the longest increasing path.

From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside of the boundary (i.e. wrap-around is not allowed).

Example 1:

Input: nums = 
[
  [9,9,4],
  [6,6,8],
  [2,1,1]
] 
Output: 4

Explanation: The longest increasing path is [1, 2, 6, 9].
Example 2:

Input: nums = 
[
  [3,4,5],
  [3,2,6],
  [2,2,1]
] 
Output: 4

Explanation: The longest increasing path is [3, 4, 5, 6]. Moving diagonally is not allowed.

Solution 
class Solution {
    private static final int[][] dirs = {{0,1},{0,-1},{-1,0},{1,0}};
    public int longestIncreasingPath(int[][] matrix) {
        if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return 0;
        int m = matrix.length, n = matrix[0].length;
        int[][] cache = new int[m][n];
        int max = 1;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                int curMax = dfs(matrix, i, j, cache);
                max = Math.max(max, curMax);
            }
        }
        return max;
    }
    
    private int dfs(int[][] matrix, int i, int j, int[][] cache) {
        //if saved(visited), return directly
        if (cache[i][j] != 0) return cache[i][j];
        int m = matrix.length, n = matrix[0].length;
        int max = 1;
        //this for loop is actually getting dfs result for 4 directions
        for (int[] dir: dirs) {
            int x = i+dir[0], y = j+dir[1];
            if (x < 0 || x >= m || y < 0 || y >= n || matrix[x][y] <= matrix[i][j]) continue;
            int curMax = 1+dfs(matrix, x, y, cache);
            max = Math.max(max, curMax);
        }
        cache[i][j] = max;
        return max;
    }
}

文章版權(quán)歸作者所有，未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請(qǐng)注明本文地址：http://systransis.cn/yun/61724.html

相關(guān)文章

  • [LeetCode] 329. Longest Increasing Path in a Matri

    Problem Given an integer matrix, find the length of the longest increasing path. From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move ou...

    hss01248 評(píng)論0 收藏0

  • leetcode 329. Longest Increasing Path in a Matrix

    摘要：題目要求思路和代碼這里采用廣度優(yōu)先算法加上緩存的方式來實(shí)現(xiàn)。我們可以看到，以一個(gè)節(jié)點(diǎn)作為開始構(gòu)成的最長(zhǎng)路徑長(zhǎng)度是確定的。因此我們可以充分利用之前得到的結(jié)論來減少重復(fù)遍歷的次數(shù)。 題目要求 Given an integer matrix, find the length of the longest increasing path. From each cell, you can ei...

    heartFollower 評(píng)論0 收藏0

  • LeetCode[329] Longest Increasing Path in a Matrix

    摘要：復(fù)雜度思路為了避免搜索已經(jīng)搜索的點(diǎn)。所以考慮用一個(gè)數(shù)組，記錄到每一個(gè)點(diǎn)能產(chǎn)生的最長(zhǎng)序列的長(zhǎng)度?？紤]用進(jìn)行搜索，對(duì)于每一個(gè)點(diǎn)來說，考慮先找到最小的那個(gè)點(diǎn)針對(duì)每一條路徑的。然后對(duì)于每一點(diǎn)再遞增回去，依次累積找到增加的值。 LeetCode[329] Longest Increasing Path in a Matrix Given an integer matrix, find the ...

    cppowboy 評(píng)論0 收藏0

  • LeetCode 329. Longest Increasing Path in a Matrix

    摘要：思路這道題主要使用記憶化遞歸和深度優(yōu)先遍歷。我們以給定的矩陣的每一個(gè)位置為起點(diǎn)，進(jìn)行深度優(yōu)先遍歷。我們存儲(chǔ)每個(gè)位置深度優(yōu)先遍歷的結(jié)果，當(dāng)下一次走到這個(gè)位置的時(shí)候，我們直接返回當(dāng)前位置記錄的值，這樣可以減少遍歷的次數(shù)，加快執(zhí)行速度。 Description Given an integer matrix, find the length of the longest increasing...

    isLishude 評(píng)論0 收藏0

  • 329. Longest Increasing Path in a Matrix

    摘要：題目解答最重要的是用保存每個(gè)掃過結(jié)點(diǎn)的最大路徑。我開始做的時(shí)候，用全局變量記錄的沒有返回值，這樣很容易出錯(cuò)，因?yàn)槿魏我粋€(gè)用到的環(huán)節(jié)都有可能改變值，所以還是在函數(shù)中定義，把當(dāng)前的直接返回計(jì)算不容易出錯(cuò)。 題目：Given an integer matrix, find the length of the longest increasing path. From each cell, y...

    hqman 評(píng)論0 收藏0

發(fā)表評(píng)論

0條評(píng)論

閱讀需要支付1元查看
<