674. Longest Continuous Increasing Subsequence

題目

674. Longest Continuous Increasing Subsequence

解題思路

• 長度<2的，返回1
• 長度≥2的，用一個標記increase記錄當前升序數組的長度，直到升序停止，再與先前最長升序數組的長度比較取最大

具體代碼

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        if (nums.size() < 2) return nums.size();

        int continus = 1, max_continus = 1;
        int increase = 1;
        for (int i = 1; i < nums.size(); i++) {
            if (nums[i] > nums[i-1]) {
                ++increase;
            }
            else {
                max_continus = max_continus > increase ? max_continus : increase;
                increase = 1;
            }

        }

        return max_continus > increase ? max_continus : increase;
    }
};