Leetcode 300. Longest Increasing Subsequence 最长的递增子序列 dp

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?

---

解法：利用一个 dp 数组，其中 dp[i] 代表使用第 i 个元素的最长递增子序列，dp[0]=1，更新 dp[i] 采用如下的方法：

令 j 从 0 到 i-1 迭代，如果数组中位置 j 的元素比位置 i 的元素小，那么在位置 i 可以通过计算到 j 的递增子序列长度加 1 得到一个更长的递增子序列。

最后遍历 dp 数组，找到一个以某一个元素结尾的最长递增子序列的长度。

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