2020-07-15 a few seconds read (About 54 words)

LC96_numTrees

题目

https://leetcode-cn.com/problems/unique-binary-search-trees/

Read More

2020-07-14 3 minutes read (About 394 words)

LC76_minWindowOC

题目

https://leetcode-cn.com/problems/minimum-window-substring/

Read More

2020-07-07 2 minutes read (About 347 words)

LC112_hasPathSum

题目

https://leetcode-cn.com/problems/path-sum/

Read More

2020-07-06 a minute read (About 124 words)

LC63_uniquePathsWithObstacles

题目

https://leetcode-cn.com/problems/unique-paths-ii/

解法

首先的思路：递归+回溯; m 与 n

public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        if (obstacleGrid == null || obstacleGrid.length == 0) {
            return 0;
        }
        int pathCount = dfs(0, 0, obstacleGrid);
        return pathCount;
    }
    /**
     * 计算是否是路径
     * @param i
     * @param j
     * @param obstacleGrid
     * @param pathCount
     */
    private int dfs(int i, int j, int[][] obstacleGrid) {
        int row = obstacleGrid.length;
        int col = obstacleGrid[0].length;
        if (i>=row||i<0 || j<0||j>=col || obstacleGrid[i][j] == 1) {
            return 0;
        }
        if((i==row-1) && (j==col-1)&&obstacleGrid[i][j] != 1) {
         
            return 1;
        }
        int downPath = 0;
        if (i+1 <row&&obstacleGrid[i+1][j] != 1) {
            downPath =  dfs(i+1, j, obstacleGrid);
        }
        int rightPath = 0;
        if (j+1 < col&&obstacleGrid[i][j+1] != 1) {
            rightPath =  dfs(i, j+1, obstacleGrid);
        }
        return downPath + rightPath;
    }

2020-07-04 2 minutes read (About 355 words)

LC32_longestValidParentheses

题目

https://leetcode-cn.com/problems/longest-valid-parentheses/

Read More

2020-06-26 a few seconds read (About 69 words)

删除重复节点

题目

https://leetcode-cn.com/problems/remove-duplicate-node-lcci/

Read More

2020-06-24 a few seconds read (About 78 words)

最接近的三数之和

题目

https://leetcode-cn.com/problems/3sum-closest/

Read More

2020-06-24 a minute read (About 159 words)

1到n的和

题目

https://leetcode-cn.com/problems/qiu-12n-lcof

Read More

2020-06-24 a minute read (About 116 words)

股票的最大利润

题目

https://leetcode-cn.com/problems/gu-piao-de-zui-da-li-run-lcof/

Read More

2020-06-23 a minute read (About 118 words)

扑克牌的顺子

题目

https://leetcode-cn.com/problems/bu-ke-pai-zhong-de-shun-zi-lcof

Read More

fallenk

研究僧

Hangzhou, ZJU

Entradas

118

Categorias

19

Etiquetas

44

Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now