300. Longest Increasing Subsequence/DP-CSDN博客

本文链接：https://blog.csdn.net/c602273091/article/details/65937411

题目描述
代码实现

题目描述

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?

LIS这道题目是典型的动规的题目，就是要找到一个序列的最长递增序列。

动规里面最有挑战就是找到状态转移方程。

代码实现

最简单的就是暴力破解：

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        int len = nums.size();
        if(!len) return 0;
        vector<vector<int> > path(len, vector<int>(len, 0));
        int res = 0;

        // O(n^3)
        for(int k = 0; k < len; k++) {
            for(int i = k+1; i < len; i++) {
                for(int j = k; j < i; j++) {
                    if(nums[i] > nums[j]) {
                        path[k][i] = (path[k][j]+1 > path[k][i])?path[k][j]+1:path[k][i];
                        if(res < path[k][i]) res = path[k][i];
                    }    
                }
            }
        }
        return res+1;
    }
};

使用DP，这里只需要找到该序列的长度，所以可以写成：

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        int len = nums.size();
        if(!len) return 0;
        vector<int> path(len, 0);
        int res = 0;

        for(int i = 1; i < len; i++) {
            for(int j = i-1; j >=0; j--) {
                if(nums[i] > nums[j]) {
                    path[i] = path[j] + 1 > path[i]? path[j]+1:path[i];
                    if(res < path[i]) res = path[i];
                }    
            }
        }
        return res+1;
    }
};