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?

Credits:
Special thanks to @pbrother for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Hide Tags

  Dynamic Programming Binary Search

经典的问题

class Solution {
public:
    // There's a typical DP solution with O(N^2) Time and O(N) space 
    // DP[i] means the result ends at i
    // So for dp[i], dp[i] is max(dp[j]+1), for all j < i and nums[j] < nums[i]
    int lengthOfLIS(vector<int>& nums) {
        const int n = nums.size();
        if(n == 0)
            return 0;
        vector<int> dp(n,1);
        int res = 1;
        for(int i = 0;i<n;i++)
        {
            for(int j = 0;j<i;j++)
            {
                if(nums[j] < nums[i])
                    dp[i] = max(dp[i],dp[j]+1);
            }
            res = max(res,dp[i]);
        }
        
        return res;
        
        
    }
};

本题的另一个tag是二分查找

参考了http://bookshadow.com/weblog/2015/11/03/leetcode-longest-increasing-subsequence/

维护一个递增的序列dp

遍历输入的数组，在dp中查找num[i]应该放置的位置，并做相应的更新

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        vector<int> dp;
        for(int i = 0;i<nums.size();++i)
        {
            int low = 0;
            int high = dp.size();
            int len = high-low;
            int half;
            int mid;
            while(len > 0)
            {
                half = len >>1;
                mid = low + half;
                if(dp[mid] < nums[i])
                {
                    low = mid +1;
                    len = len -half - 1;
                }
                else
                    len = half;
            }
            if(low >= dp.size())
                dp.push_back(nums[i]);
            else
                dp[low] = nums[i];
                
        }
        
        return dp.size();
        
    }
};