剑指 Offer刷题day8| 10- I. 斐波那契数列，10- II. 青蛙跳台阶问题，63. 股票的最大利润

剑指 Offer 10- I. 斐波那契数列

题目描述：剑指 Offer 10- I. 斐波那契数列

class Solution {
public:
    int fib(int n) {
        if(n == 0)return 0;
        if(n == 1)return 1;
        int temp1 = 0, temp2 = 1;
        int result;
        int mod = 1e9+7;
        for(int i = 2; i <= n; i++){
            result = (temp1 + temp2) % mod;
            temp1 = temp2;
            temp2 = result;
        }
        return result;
    }
};

剑指 Offer 10- II. 青蛙跳台阶问题

题目描述：剑指 Offer 10- II. 青蛙跳台阶问题

class Solution {
public:
    int numWays(int n) {
        if(n == 0)return 1;
        if(n == 1)return 1;
        if(n == 2)return 2;
        int a = 1, b = 2, result;
        int mod = 1e9+7;
        for(int i = 3; i <= n; i++){
            result = (a + b) % mod;
            a = b;
            b = result;
        }
        return result;
    }
};

剑指 Offer 63. 股票的最大利润

题目描述：剑指 Offer 63. 股票的最大利润
题解思路：面试题63. 股票的最大利润（动态规划，清晰图解）

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int result = 0;
        int minNumber = 99999;
        int maxNumber = 0;
        for(int i : prices){
            minNumber = min(i, minNumber);
            maxNumber = max(i, minNumber);
            result =max(result, maxNumber - minNumber);
        }
        return result;
    }
};

收获

1. 1e9+7是double类型，不能直接用作取余，需要转换成int类型