题解 | #递减种子序列#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param seeds int整型vector 
     * @return int整型
     */
    int lengthOfLIS(vector<int>& seeds) {
        // write code here
        int len = seeds.size();
        vector<int> lenvec(len, 1);
        int maxLen = 1;
        for (int i = 1; i < len; i++) {
            int j = i-1;
            while (j >= 0 && seeds[j] <= seeds[i]) j--;
            if (j >= 0) {
                lenvec[i] = lenvec[j] + 1;
            }
            maxLen = max(maxLen, lenvec[i]);
        }
        return maxLen;
    }
};