300. Longest Increasing Subsequence（图解）

300. Longest Increasing Subsequence

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?

Solution

C++ Sol1

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        vector<int> res;
        for(int i = 0; i < nums.size(); ++i) {
            int index = find_lower_bound(nums[i], res);
            if(index == res.size()) res.push_back(nums[i]);
            else res[index] = nums[i];
            //cout << index << ' ';
        }
        //for(int i = 0; i < res.size(); ++i) cout << res[i] << ' ';
        return res.size();
    }
    
    int find_lower_bound(int num, vector<int>& res) {
        int i = 0, j = res.size()-1;
        while(i < j) {
            int mid = i+(j-i)/2;
            if(res[mid] < num) i = mid + 1;
            else j = mid;
        }
        if(i == j && res[i] < num) return i+1;
        else return i;
    }
};

C++ Sol2

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

Explanation
方法一：基于二分法
复杂度$O(nlogn)$
参考：https://leetcode.com/problems/longest-increasing-subsequence/discuss/74824/JavaPython-Binary-search-O(nlogn)-time-with-explanation

方法二：dp
复杂度$O(n^2)$