300 Longest Increasing Subsequence

1 题目

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

Example:

Input: [10,9,2,5,3,7,101,18]
Output: 4 
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4. 
Note:

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?

2 尝试解

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        if(nums.size() == 0) return 0;
        int result = 1;
        //saver[i] record longest increasing sequence in interval[0,i], saver[i] = saver[j]+1 where j is the maximal element in set<k> that nums[k] < nums[i] and k < i
        vector<int> saver(nums.size(),1);
        for(int i = 1; i < nums.size(); i++){
            for(int j = i-1; j >= 0; j --){
                if(nums[j] < nums[i]&& saver[i] < saver[j]+1) {
                    saver[i] = saver[j] + 1;
                }
            }
            if (result < saver[i]) result = saver[i];
        }        
        return result;
    }
};

3 标准解

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();
}