300. Longest Increasing Subsequence

Posted 为了更优秀的你,加油!

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了300. Longest Increasing Subsequence相关的知识,希望对你有一定的参考价值。

Given an unsorted array of integers, find the length of longest increasing subsequence.

For example,
Given [10, 9, 2, 5, 3, 7, 101, 18],
The longest increasing subsequence is [2, 3, 7, 101], therefore the length is 4. Note that there may be more than one LIS combination, it is only necessary for you to return the length.

Your algorithm should run in O(n2) complexity.

Follow up: Could you improve it to O(n log n) time complexity?

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        vector<int> res;
        for(int i=0; i<nums.size(); i++) {
            auto it = std::lower_bound(res.begin(), res.end(), nums[i]);
            if(it==res.end()) res.push_back(nums[i]);
            else *it = nums[i];
        }
        return res.size();
    }
};

 

以上是关于300. Longest Increasing Subsequence的主要内容,如果未能解决你的问题,请参考以下文章

300. Longest Increasing Subsequence

300. Longest Increasing Subsequence

300. Longest Increasing Subsequence

300. Longest Increasing Subsequence

300. Longest Increasing Subsequence

300. Longest Increasing Subsequence