LeetCode --- 300. Longest Increasing Subsequence

300. Longest Increasing Subsequence

Difficulty: Medium

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

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

Solution

Language: C++

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        if (nums.empty())   return false;
        int res = 1;
        vector<int> dp(nums.size()+1, 1);
        for (int i = 1; i < nums.size(); ++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;
    }
};