Leetcode 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(n²) complexity.

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

 

解决方法：

用DP来解这道题，对每一个数，跟之前的数比较，如果大于该数，则满足需求。

用这个算法的复杂度应该是O(n²).

代码：

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