算法-动态规划

算法-动态规划

一、算法-动态规划

动态规划（Dynamic Programming，DP），是求解决策过程最优化的过程。

• 多阶段决策问题：如果一类活动过程可以分为若干个互相联系的阶段，在每一个阶段都需作出决策（采取措施），一个阶段的决策确定以后，常常影响到下一个阶段的决策，从而就完全确定了一个过程的活动路线，则称它为多阶段决策问题
• 各个阶段的决策构成一个决策序列，称为一个策略。每一个阶段都有若干个决策可供选择，因而就有许多策略供我们选取，对应于一个策略可以确定活动的效果，这个效果可以用数量来确定。策略不同，效果也不同，多阶段决策问题，就是要在可以选择的那些策略中间，选取一个最优策略，使在预定的标准下达到最好的效果。

最优化原理：作为整个过程的最优策略，它满足：相对前面决策所形成的状态而言，余下的子策略必然构成“最优子策略”。

二、爬楼梯问题

class Solution {
    public int climbStairs(int n) {
        // n = 1 -> 1 (ways -> 1)
        // n = 2 -> 2(ways, 11, 2)
        // n = 3 -> 3(ways 111, 12, 21)
        // n = 4 -> 5(ways 1111,112,121,211,22)
        // n = 5 -> 8(ways 11111,1112,1121,1211,2111,221,212,122)
        if (n <= 3) {
            return n;
        } 
        int[] steps = new int[3];
        steps[0] = 1;
        steps[1] = 2;
        //循环数组
        for (int i = 2; i < n; i++) {
            steps[i % 3] = steps[(i - 1) % 3] + steps[(i - 2) % 3];
        }
        return steps[(n - 1) % 3];
    }
}
     
     /*  DFS
      public int climbStairs(int n) {
        // n == 1 -> 1
        // n == 2 -> 2
        // n == 0 -> 0
        if (n < 3) {
            return n;
        }
        return climbStairs(n - 1) + climbStairs(n - 2);
    }
     */

    /* DP
    steps 
    0 1 2 3 4 5 ... 50
      1 2 3 5 8     ...
      public int climbStairs(int n) {
        // n == 1 -> 1
        // n == 2 -> 2
        // n == 0 -> 0
        if (n < 3) {
            return n;
        }
        int[] steps = new int[n + 1];
        steps[1] = 1;
        steps[2] = 2;
        for (int i = 3; i <= n; i++) {
            steps[i] = steps[i - 1] + steps[i - 2];
        }
        return steps[n];
    }
    */
    
/*
steps 
0 1 2
5 8 3
https://leetcode.com/problems/fibonacci-number/
https://leetcode.com/problems/house-robber/
*/

三、独一道路问题

public int uniquePaths(int m, int n) {
         if(m == 0 || n == 0) {
             return 1;
         }
        int[][] path = new int[m][n];
        //初始化x=1
        for (int i  = 0; i < m; i++) {
            path[i][0] = 1;
        }    
        //初始化y=1
        for (int i = 0; i < n; i++) {
            path[0][i] = 1;
        }
        
        //当前节点=上面一个节点+前面一个节点
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                path[i][j] = path[i - 1][j] + path[i][j - 1];
            }
        }
        //唯一道路
        return path[m - 1][n - 1];
    }


    

独一道路有障碍节点的的道路

    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        if (obstacleGrid == null || obstacleGrid.length == 0) {
            return 1;
        }
        if (obstacleGrid[0] == null || obstacleGrid[0].length == 0) {
            return 1;
        }
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][] result = new int[m][n];
        for (int i = 0; i < m; i++) {
            if (obstacleGrid[i][0] != 1) {
                result[i][0] = 1;
            } else {
                break;
            }
        }
        for (int j = 0; j < n; j++) {
            if (obstacleGrid[0][j] != 1) {
                result[0][j] = 1;
            } else {
                break;
            }
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                //障碍节点 赋值0
                if (obstacleGrid[i][j] == 1) {
                    result[i][j] = 0;
                } else {
                    result[i][j] = result[i - 1][j] + result[i][j - 1];
                }
            }
        }
        return result[m - 1][n - 1];
    }

四、最长子串问题

class Solution {
    public int longestCommonSubsequence(String A, String B) {
        if (A == null || A.length() == 0 || B == null || B.length() == 0) {
            return 0;
        }
        int aLength = A.length();
        int bLength = B.length();
        //二维数组
        int[][] longest = new int[aLength + 1][bLength + 1];
        for (int i = 1; i <= A.length(); i++) {
            for (int j = 1; j <= B.length; j++) {
                if (A.charAt(i- 1) == B.charAt(j - 1)) {
                    longest[i][j] = longest[i - 1][j - 1] + 1;
                } else {
                    longest[i][j] = Math.max(longest[i - 1][j], longest[i][j - 1]);
                }
            }
        }
        return longest[aLength][bLength];
    }
}

五、单词拆分问题

class Solution {
    public boolean wordBreak(String s, List<String> wordDict) {
        Set<String> dict = new HashSet<>();
        for (String word: wordDict) {
            dict.add(word);
        }
        boolean[] canSegment = new boolean[s.length() + 1];
        canSegment[0] = true;
        //单词最大的长度
        int largetlengthWord = getLargest(dict);
        for (int i = 1; i <= s.length(); i++) {
            for (int j = 0; j <= largetlengthWord && j <= i; j++) {
                if (!canSegment[i - j]) {
                    continue;
                }
                if (dict.contains(s.substring(i - j, i))) {
                    canSegment[i] = true;
                }
            }
        }
        return canSegment[s.length()];
    }
    
    //单词最大的长度
    public int getLargest(Set<String> dict) {
        int max = 0;
        for (String word: dict) {
            max = Math.max(max, word.length());
        }
        return max;
    }
}


//               l e e t c o d e
//cansegment// 1 0 0 0 1       1
    //index//  0 1 2 3 4 5 6 7 8

六、回文分割问题

class Solution {
    public int minCut(String s) {
        if (s == null || s.length() == 0) {
            return 0;
        }
        int[] minCut = new int[s.length() + 1];
        //初始化
        for (int i = 0; i <= s.length(); i++) {
            minCut[i] = i - 1;
        }
        boolean[][] pali = new boolean[s.length()][s.length()];
        //回文
        assignPali(pali, s);
        for (int i = 1; i <= s.length(); i++) {
            for (int j = 0; j < i; j++) {
                if (pali[j][i - 1]) {
                    minCut[i] = Math.min(minCut[j] + 1, minCut[i]);
                }
            }
        }
        return minCut[s.length()];
    }
    
    //回文判断
    public void assignPali(boolean[][] pali, String s) {
        int length = s.length();
        for (int i = 0; i < length; i++) {
            pali[i][i] = true;
        }
        for (int i = 0; i < length - 1; i++) {
            pali[i][i + 1] = (s.charAt(i) == s.charAt(i + 1));
        }
        for (int i = 2; i < length; i++) {
            for (int j = 0; j + i < length; j++) {
                pali[j][i + j] = pali[j + 1][i + j - 1] && s.charAt(j) == s.charAt(i + j);
            }
        }
    }
}