DP

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        int n = nums.size();
        vector<int> f(n, 1);
        int res = 1;
        for (int i = 1; i < n; i ++) {
            if (nums[i] > nums[i - 1]) {
                f[i] = f[i - 1] + 1;
            }
            res = max(res, f[i]);
        }
        return res;
    }
};

贪心

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        int res = 0;
        for (int i = 0, j = 0; i < nums.size(); i++) {
            if (i && nums[i] <= nums[i - 1]) {
                j = i;
            }
            res = max(res, i - j + 1);
        }
        return res;
    }
};