2022.4.25 剑指offer 10-1,10-2,63

学习剑指offer 第八天

10-1 斐波那契数列

public int fib(int n) {
        if(n == 0) return 0;
        if(n == 1) return 1;
        //构建dp数组
        int[] dp = new int[n + 1];
        //初始化
        dp[0] = 0;
        dp[1] = 1;
        for(int i = 2; i <= n; i++){
            dp[i] = dp[i - 1] + dp[i - 2];
            dp[i] = dp[i] % 1000000007;
        }
        return dp[n];
    }

10-2 青蛙跳台阶问题

    public int numWays(int n) {
        if(n == 0) return 1;
        if(n == 1) return 1;
        int[] dp = new int[n + 1];
        //初始化
        dp[0] = 1;
        dp[1] = 1;
        for(int i = 2; i <= n; i++){
            dp[i] = dp[i - 1] + dp[i - 2];
            dp[i] = dp[i] % 1000000007;
        }
        return dp[n];
    }

63 股票的最大利润

    public int maxProfit(int[] prices) {
        if(prices.length == 0) return 0;
        //dp数组：第i天持有/不持有股票的最大利润
        int[][] dp = new int[prices.length][2];
        //初始化
        dp[0][0] = -prices[0];
        dp[0][1] = 0;
        for(int i = 1; i < prices.length; i++){
            dp[i][0] = Math.max(dp[i - 1][0], -prices[i]);
            dp[i][1] = Math.max(dp[i - 1][1], dp[i - 1][0] + prices[i]);
        }
        return dp[prices.length - 1][1];
    }